Base | Representation |
---|---|
bin | 1001000110101101111001… |
… | …1101001110111101110001 |
3 | 1022110001011012222020112002 |
4 | 2101223132131032331301 |
5 | 2303010020014130410 |
6 | 33142554225543345 |
7 | 2052162030010610 |
oct | 221533635167561 |
9 | 38401135866462 |
10 | 10011006005105 |
11 | 320a7099a3606 |
12 | 11582497a4b55 |
13 | 5780593a6291 |
14 | 26876cb23877 |
15 | 1256212bb7a5 |
hex | 91ade74ef71 |
10011006005105 has 8 divisors (see below), whose sum is σ = 13729379664192. Its totient is φ = 6864689832048.
The previous prime is 10011006005089. The next prime is 10011006005107. The reversal of 10011006005105 is 50150060011001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10011006005105 - 24 = 10011006005089 is a prime.
It is a super-2 number, since 2×100110060051052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10011006005107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143014371467 + ... + 143014371536.
It is an arithmetic number, because the mean of its divisors is an integer number (1716172458024).
Almost surely, 210011006005105 is an apocalyptic number.
It is an amenable number.
10011006005105 is a deficient number, since it is larger than the sum of its proper divisors (3718373659087).
10011006005105 is an equidigital number, since it uses as much as digits as its factorization.
10011006005105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286028743015.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 10011006005105 its reverse (50150060011001), we get a palindrome (60161066016106).
The spelling of 10011006005105 in words is "ten trillion, eleven billion, six million, five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •