Base | Representation |
---|---|
bin | 1001001001101000100001… |
… | …01100111101001011001001 |
3 | 2122020122220212002102012022 |
4 | 10210310100230331023021 |
5 | 10114140232203031441 |
6 | 110444002331054225 |
7 | 4144531631632352 |
oct | 444642054751311 |
9 | 78218825072168 |
10 | 20122202002121 |
11 | 6458861499a1a |
12 | 230b9988a1375 |
13 | b2c691750b2b |
14 | 4d7cc3c02d29 |
15 | 24d65830184b |
hex | 124d10b3d2c9 |
20122202002121 has 8 divisors (see below), whose sum is σ = 20779999929600. Its totient is φ = 19464947489520.
The previous prime is 20122202002027. The next prime is 20122202002127. The reversal of 20122202002121 is 12120020222102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20122202002121 - 230 = 20121128260297 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 20122202002121.
It is not an unprimeable number, because it can be changed into a prime (20122202002127) 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, 135778451 + ... + 135926568.
It is an arithmetic number, because the mean of its divisors is an integer number (2597499991200).
Almost surely, 220122202002121 is an apocalyptic number.
It is an amenable number.
20122202002121 is a deficient number, since it is larger than the sum of its proper divisors (657797927479).
20122202002121 is a wasteful number, since it uses less digits than its factorization.
20122202002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271707439.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20122202002121 its reverse (12120020222102), we get a palindrome (32242222224223).
The spelling of 20122202002121 in words is "twenty trillion, one hundred twenty-two billion, two hundred two million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •