Base | Representation |
---|---|
bin | 1001000110101010100111… |
… | …0001011100110000010101 |
3 | 1022102221212121202211011012 |
4 | 2101222221301130300111 |
5 | 2303001212230041041 |
6 | 33142330413022005 |
7 | 2052131105025053 |
oct | 221525161346025 |
9 | 38387777684135 |
10 | 10010122112021 |
11 | 320a2a5a72659 |
12 | 1158041784905 |
13 | 577c4822c015 |
14 | 2686c759b1d3 |
15 | 1255bd8c23eb |
hex | 91aa9c5cc15 |
10010122112021 has 8 divisors (see below), whose sum is σ = 10203711048864. Its totient is φ = 9818385701200.
The previous prime is 10010122111919. The next prime is 10010122112057. The reversal of 10010122112021 is 12021122101001.
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 10010122112021 - 210 = 10010122110997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10010122111987 and 10010122112005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010122112321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 463120595 + ... + 463142208.
It is an arithmetic number, because the mean of its divisors is an integer number (1275463881108).
Almost surely, 210010122112021 is an apocalyptic number.
It is an amenable number.
10010122112021 is a deficient number, since it is larger than the sum of its proper divisors (193588936843).
10010122112021 is a wasteful number, since it uses less digits than its factorization.
10010122112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 926263011.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10010122112021 its reverse (12021122101001), we get a palindrome (22031244213022).
The spelling of 10010122112021 in words is "ten trillion, ten billion, one hundred twenty-two million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •