Base | Representation |
---|---|
bin | 1001000110011011110110… |
… | …10110000100000000111001 |
3 | 2121212011022010111122010112 |
4 | 10203031323112010000321 |
5 | 10110340213413410431 |
6 | 110321311145354105 |
7 | 4133561665300505 |
oct | 443157326040071 |
9 | 77764263448115 |
10 | 20012322013241 |
11 | 64161a6068a58 |
12 | 22b2632198935 |
13 | b22200082c2c |
14 | 4d285c93d305 |
15 | 24a876a12c2b |
hex | 12337b584039 |
20012322013241 has 2 divisors, whose sum is σ = 20012322013242. Its totient is φ = 20012322013240.
The previous prime is 20012322013199. The next prime is 20012322013247. The reversal of 20012322013241 is 14231022321002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15875283984400 + 4137038028841 = 3984380^2 + 2033971^2 .
It is a cyclic number.
It is not a de Polignac number, because 20012322013241 - 210 = 20012322012217 is a prime.
It is a super-2 number, since 2×200123220132412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20012322013247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10006161006620 + 10006161006621.
It is an arithmetic number, because the mean of its divisors is an integer number (10006161006621).
Almost surely, 220012322013241 is an apocalyptic number.
It is an amenable number.
20012322013241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20012322013241 is an equidigital number, since it uses as much as digits as its factorization.
20012322013241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 20012322013241 its reverse (14231022321002), we get a palindrome (34243344334243).
The spelling of 20012322013241 in words is "twenty trillion, twelve billion, three hundred twenty-two million, thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •