Base | Representation |
---|---|
bin | 1001001101001011011101… |
… | …1101110101101101111111 |
3 | 1022211122201001021102000212 |
4 | 2103102313131311231333 |
5 | 2311314344334031421 |
6 | 33305554154343035 |
7 | 2063202054633164 |
oct | 223226735655577 |
9 | 38748631242025 |
10 | 10122021002111 |
11 | 32527a7a7aa17 |
12 | 117587042aa7b |
13 | 58566bc61515 |
14 | 26dca0a3a06b |
15 | 12846c558e5b |
hex | 934b7775b7f |
10122021002111 has 8 divisors (see below), whose sum is σ = 10586168355840. Its totient is φ = 9659878605432.
The previous prime is 10122021002099. The next prime is 10122021002117. The reversal of 10122021002111 is 11120012022101.
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 10122021002111 - 26 = 10122021002047 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122021002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 501228935 + ... + 501249128.
It is an arithmetic number, because the mean of its divisors is an integer number (1323271044480).
Almost surely, 210122021002111 is an apocalyptic number.
10122021002111 is a deficient number, since it is larger than the sum of its proper divisors (464147353729).
10122021002111 is a wasteful number, since it uses less digits than its factorization.
10122021002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002478525.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10122021002111 its reverse (11120012022101), we get a palindrome (21242033024212).
The spelling of 10122021002111 in words is "ten trillion, one hundred twenty-two billion, twenty-one million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •