Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0100111111000010011110 |
3 | 1022210111200102101211201122 |
4 | 2103013223010333002132 |
5 | 2311120241003000110 |
6 | 33300245405410542 |
7 | 2062265163044612 |
oct | 223075304770236 |
9 | 38714612354648 |
10 | 10110002000030 |
11 | 324869a61a849 |
12 | 1173477269a52 |
13 | 5844a4ba587a |
14 | 26d4806b3342 |
15 | 127eb72d3255 |
hex | 931eb13f09e |
10110002000030 has 16 divisors (see below), whose sum is σ = 18199323596160. Its totient is φ = 4043707467552.
The previous prime is 10110002000029. The next prime is 10110002000081. The reversal of 10110002000030 is 3000020001101.
It is a super-2 number, since 2×101100020000302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110001999981 and 10110002000017.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36521774 + ... + 36797553.
It is an arithmetic number, because the mean of its divisors is an integer number (1137457724760).
Almost surely, 210110002000030 is an apocalyptic number.
10110002000030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110002000030 is a deficient number, since it is larger than the sum of its proper divisors (8089321596130).
10110002000030 is a wasteful number, since it uses less digits than its factorization.
10110002000030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73333123.
The product of its (nonzero) digits is 6, while the sum is 8.
Adding to 10110002000030 its reverse (3000020001101), we get a palindrome (13110022001131).
The spelling of 10110002000030 in words is "ten trillion, one hundred ten billion, two million, thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •