Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …10110000000111100111001 |
3 | 2122020122200120221000200122 |
4 | 10210310023112000330321 |
5 | 10114140041144232301 |
6 | 110443545400143025 |
7 | 4144526460534434 |
oct | 444641326007471 |
9 | 78218616830618 |
10 | 20122112102201 |
11 | 645881577686a |
12 | 230b972767a75 |
13 | b2c678c35605 |
14 | 4d7cb5cc081b |
15 | 24d65049481b |
hex | 124d0b580f39 |
20122112102201 has 8 divisors (see below), whose sum is σ = 20273943929184. Its totient is φ = 19970352088480.
The previous prime is 20122112102159. The next prime is 20122112102401. The reversal of 20122112102201 is 10220121122102.
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 20122112102201 - 234 = 20104932233017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20122112102201.
It is not an unprimeable number, because it can be changed into a prime (20122112102101) 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, 17390735 + ... + 18511668.
It is an arithmetic number, because the mean of its divisors is an integer number (2534242991148).
Almost surely, 220122112102201 is an apocalyptic number.
It is an amenable number.
20122112102201 is a deficient number, since it is larger than the sum of its proper divisors (151831826983).
20122112102201 is a wasteful number, since it uses less digits than its factorization.
20122112102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35906631.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20122112102201 its reverse (10220121122102), we get a palindrome (30342233224303).
The spelling of 20122112102201 in words is "twenty trillion, one hundred twenty-two billion, one hundred twelve million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •