Base | Representation |
---|---|
bin | 1001001001101000100001… |
… | …01101000001110010011001 |
3 | 2122020122220212010101010011 |
4 | 10210310100231001302121 |
5 | 10114140232204133032 |
6 | 110444002331321521 |
7 | 4144531632041425 |
oct | 444642055016231 |
9 | 78218825111104 |
10 | 20122202021017 |
11 | 6458861502138 |
12 | 230b9988b02a1 |
13 | b2c691759605 |
14 | 4d7cc3c09b85 |
15 | 24d658307247 |
hex | 124d10b41c99 |
20122202021017 has 2 divisors, whose sum is σ = 20122202021018. Its totient is φ = 20122202021016.
The previous prime is 20122202021011. The next prime is 20122202021039. The reversal of 20122202021017 is 71012020222102.
It is an a-pointer prime, because the next prime (20122202021039) can be obtained adding 20122202021017 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14605077512281 + 5517124508736 = 3821659^2 + 2348856^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122202021017 - 211 = 20122202018969 is a prime.
It is not a weakly prime, because it can be changed into another prime (20122202021011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061101010508 + 10061101010509.
It is an arithmetic number, because the mean of its divisors is an integer number (10061101010509).
Almost surely, 220122202021017 is an apocalyptic number.
It is an amenable number.
20122202021017 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122202021017 is an equidigital number, since it uses as much as digits as its factorization.
20122202021017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 20122202021017 its reverse (71012020222102), we get a palindrome (91134222243119).
The spelling of 20122202021017 in words is "twenty trillion, one hundred twenty-two billion, two hundred two million, twenty-one thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •