Base | Representation |
---|---|
bin | 1001001011111001111000… |
… | …1100001111011100101110 |
3 | 1022202120011212200001000020 |
4 | 2102332132030033130232 |
5 | 2310440022230401110 |
6 | 33251533153343010 |
7 | 2061465304342563 |
oct | 222763614173456 |
9 | 38676155601006 |
10 | 10100122122030 |
11 | 324448a6a0216 |
12 | 117157a567a66 |
13 | 58358c055a05 |
14 | 26cbc449c86a |
15 | 127ad9c51d70 |
hex | 92f9e30f72e |
10100122122030 has 16 divisors (see below), whose sum is σ = 24240293092944. Its totient is φ = 2693365899200.
The previous prime is 10100122122001. The next prime is 10100122122047. The reversal of 10100122122030 is 3022122100101.
It is a super-2 number, since 2×101001221220302 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168335368671 + ... + 168335368730.
It is an arithmetic number, because the mean of its divisors is an integer number (1515018318309).
Almost surely, 210100122122030 is an apocalyptic number.
10100122122030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100122122030 is an abundant number, since it is smaller than the sum of its proper divisors (14140170970914).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10100122122030 is a wasteful number, since it uses less digits than its factorization.
10100122122030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336670737411.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10100122122030 its reverse (3022122100101), we get a palindrome (13122244222131).
The spelling of 10100122122030 in words is "ten trillion, one hundred billion, one hundred twenty-two million, one hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •