Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …10010001101111100110101 |
3 | 2122011201210210001010220210 |
4 | 10210201131102031330311 |
5 | 10113322410033031401 |
6 | 110430423053220033 |
7 | 4143215411520501 |
oct | 444413522157465 |
9 | 78151723033823 |
10 | 20102012002101 |
11 | 6450240798097 |
12 | 2307aa3191619 |
13 | b2a7c48b0763 |
14 | 4d6d2a5bd301 |
15 | 24cd75a544d6 |
hex | 12485d48df35 |
20102012002101 has 8 divisors (see below), whose sum is σ = 27456406637184. Its totient is φ = 13074479350880.
The previous prime is 20102012002087. The next prime is 20102012002151. The reversal of 20102012002101 is 10120021020102.
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 20102012002101 - 25 = 20102012002069 is a prime.
It is a super-2 number, since 2×201020120021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102012002151) 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, 81715495821 + ... + 81715496066.
It is an arithmetic number, because the mean of its divisors is an integer number (3432050829648).
Almost surely, 220102012002101 is an apocalyptic number.
It is an amenable number.
20102012002101 is a deficient number, since it is larger than the sum of its proper divisors (7354394635083).
20102012002101 is a wasteful number, since it uses less digits than its factorization.
20102012002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163430991931.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20102012002101 its reverse (10120021020102), we get a palindrome (30222033022203).
The spelling of 20102012002101 in words is "twenty trillion, one hundred two billion, twelve million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •