Base | Representation |
---|---|
bin | 11001000000111000110000… |
… | …001001011100000000000111 |
3 | 112102112001110102000112222202 |
4 | 121000320300021130000013 |
5 | 103404414240111200403 |
6 | 1025550505554545115 |
7 | 32113053252623405 |
oct | 3100706011340007 |
9 | 472461412015882 |
10 | 110012100100103 |
11 | 32064962551523 |
12 | 104090b989819b |
13 | 49501340b31c6 |
14 | 1d24884d78475 |
15 | caba01b57688 |
hex | 640e3025c007 |
110012100100103 has 48 divisors (see below), whose sum is σ = 120594429476352. Its totient is φ = 100144690800000.
The previous prime is 110012100100099. The next prime is 110012100100141. The reversal of 110012100100103 is 301001001210011.
It is a happy number.
It is not a de Polignac number, because 110012100100103 - 22 = 110012100100099 is a prime.
It is a super-2 number, since 2×1100121001001032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012100100303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7829478428 + ... + 7829492478.
It is an arithmetic number, because the mean of its divisors is an integer number (2512383947424).
Almost surely, 2110012100100103 is an apocalyptic number.
110012100100103 is a deficient number, since it is larger than the sum of its proper divisors (10582329376249).
110012100100103 is a wasteful number, since it uses less digits than its factorization.
110012100100103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19904 (or 19875 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 110012100100103 its reverse (301001001210011), we get a palindrome (411013101310114).
The spelling of 110012100100103 in words is "one hundred ten trillion, twelve billion, one hundred million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •