Base | Representation |
---|---|
bin | 10001101000110010001… |
… | …001000101100100110001 |
3 | 11021212102220021000122022 |
4 | 101220302021011210301 |
5 | 124324210114123101 |
6 | 2324443434121225 |
7 | 153365015122133 |
oct | 21506211054461 |
9 | 4255386230568 |
10 | 1212022020401 |
11 | 428019918a45 |
12 | 176a93880215 |
13 | 8a3a718c44a |
14 | 4293b039053 |
15 | 217da35aa1b |
hex | 11a32245931 |
1212022020401 has 2 divisors, whose sum is σ = 1212022020402. Its totient is φ = 1212022020400.
The previous prime is 1212022020397. The next prime is 1212022020403. The reversal of 1212022020401 is 1040202202121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 872131854400 + 339890166001 = 933880^2 + 583001^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212022020401 - 22 = 1212022020397 is a prime.
Together with 1212022020403, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1212022020401.
It is not a weakly prime, because it can be changed into another prime (1212022020403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606011010200 + 606011010201.
It is an arithmetic number, because the mean of its divisors is an integer number (606011010201).
Almost surely, 21212022020401 is an apocalyptic number.
It is an amenable number.
1212022020401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212022020401 is an equidigital number, since it uses as much as digits as its factorization.
1212022020401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 1212022020401 its reverse (1040202202121), we get a palindrome (2252224222522).
The spelling of 1212022020401 in words is "one trillion, two hundred twelve billion, twenty-two million, twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •