Base | Representation |
---|---|
bin | 110000011011011100… |
… | …0100011101000011001 |
3 | 100221102221100221111000 |
4 | 1200312320203220121 |
5 | 3200443000321102 |
6 | 115435453055213 |
7 | 10341134335335 |
oct | 1406670435031 |
9 | 327387327430 |
10 | 104000010777 |
11 | 40119327433 |
12 | 181a5487509 |
13 | 9a65436020 |
14 | 50683b87c5 |
15 | 2a8a4b301c |
hex | 1836e23a19 |
104000010777 has 64 divisors (see below), whose sum is σ = 174855744000. Its totient is φ = 60610809600.
The previous prime is 104000010733. The next prime is 104000010787. The reversal of 104000010777 is 777010000401.
It is not a de Polignac number, because 104000010777 - 220 = 103998962201 is a prime.
It is a super-2 number, since 2×1040000107772 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 104000010777.
It is not an unprimeable number, because it can be changed into a prime (104000010787) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 751599 + ... + 879147.
It is an arithmetic number, because the mean of its divisors is an integer number (2732121000).
Almost surely, 2104000010777 is an apocalyptic number.
It is an amenable number.
104000010777 is a deficient number, since it is larger than the sum of its proper divisors (70855733223).
104000010777 is a wasteful number, since it uses less digits than its factorization.
104000010777 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127695 (or 127689 counting only the distinct ones).
The product of its (nonzero) digits is 1372, while the sum is 27.
The spelling of 104000010777 in words is "one hundred four billion, ten thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •