Base | Representation |
---|---|
bin | 11001000000110110110010… |
… | …111110001110101101111111 |
3 | 112102111212001001022221002221 |
4 | 121000312302332032231333 |
5 | 103404400440000310421 |
6 | 1025545521334430211 |
7 | 32112650232303145 |
oct | 3100666276165577 |
9 | 472455031287087 |
10 | 110010000010111 |
11 | 32063a85061863 |
12 | 10408812502367 |
13 | 494cb8ac933c6 |
14 | 1d247260a7595 |
15 | cab92c5c3841 |
hex | 640db2f8eb7f |
110010000010111 has 8 divisors (see below), whose sum is σ = 116482052531520. Its totient is φ = 103538044827648.
The previous prime is 110010000010109. The next prime is 110010000010121. The reversal of 110010000010111 is 111010000010011.
It is a happy number.
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 110010000010111 - 21 = 110010000010109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110010000010094 and 110010000010103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010000010121) 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, 22001506 + ... + 26534623.
It is an arithmetic number, because the mean of its divisors is an integer number (14560256566440).
Almost surely, 2110010000010111 is an apocalyptic number.
110010000010111 is a deficient number, since it is larger than the sum of its proper divisors (6472052521409).
110010000010111 is a wasteful number, since it uses less digits than its factorization.
110010000010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48669473.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110010000010111 its reverse (111010000010011), we get a palindrome (221020000020122).
The spelling of 110010000010111 in words is "one hundred ten trillion, ten billion, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •