Base | Representation |
---|---|
bin | 10110101111001101011000… |
… | …100110011000110110001110 |
3 | 111010002000121021011110100202 |
4 | 112233031120212120312032 |
5 | 101101404434230323042 |
6 | 552403531025253502 |
7 | 30030564131104205 |
oct | 2657153046306616 |
9 | 433060537143322 |
10 | 100001210011022 |
11 | 29955303030391 |
12 | b270aa2a94292 |
13 | 43a50c5a33cb8 |
14 | 1a9a1277ca23c |
15 | b863dab36632 |
hex | 5af358998d8e |
100001210011022 has 4 divisors (see below), whose sum is σ = 150001815016536. Its totient is φ = 50000605005510.
The previous prime is 100001210011007. The next prime is 100001210011057. The reversal of 100001210011022 is 220110012100001.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1000012100110222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100001210010994 and 100001210011012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25000302502754 + ... + 25000302502757.
It is an arithmetic number, because the mean of its divisors is an integer number (37500453754134).
Almost surely, 2100001210011022 is an apocalyptic number.
100001210011022 is a deficient number, since it is larger than the sum of its proper divisors (50000605005514).
100001210011022 is an equidigital number, since it uses as much as digits as its factorization.
100001210011022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50000605005513.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 100001210011022 its reverse (220110012100001), we get a palindrome (320111222111023).
The spelling of 100001210011022 in words is "one hundred trillion, one billion, two hundred ten million, eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •