Base | Representation |
---|---|
bin | 110000011011011100… |
… | …1101101110100001011 |
3 | 100221102221221101022000 |
4 | 1200312321231310023 |
5 | 3200443040032020 |
6 | 115435503402043 |
7 | 10341140042250 |
oct | 1406671556413 |
9 | 327387841260 |
10 | 104000314635 |
11 | 40119514758 |
12 | 181a55b3323 |
13 | 9a65511419 |
14 | 5068457427 |
15 | 2a8a523090 |
hex | 1836e6dd0b |
104000314635 has 32 divisors (see below), whose sum is σ = 211302228480. Its totient is φ = 47543000544.
The previous prime is 104000314603. The next prime is 104000314657. The reversal of 104000314635 is 536413000401.
104000314635 is a `hidden beast` number, since 10 + 4 + 0 + 0 + 0 + 3 + 14 + 635 = 666.
It is not a de Polignac number, because 104000314635 - 25 = 104000314603 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 104000314599 and 104000314608.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 55025677 + ... + 55027566.
It is an arithmetic number, because the mean of its divisors is an integer number (6603194640).
Almost surely, 2104000314635 is an apocalyptic number.
104000314635 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104000314635 is an abundant number, since it is smaller than the sum of its proper divisors (107301913845).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104000314635 is a wasteful number, since it uses less digits than its factorization.
104000314635 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110053264 (or 110053258 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The spelling of 104000314635 in words is "one hundred four billion, three hundred fourteen thousand, six hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •