Base | Representation |
---|---|
bin | 1001001100010001101010… |
… | …10110111111010111000001 |
3 | 2122120100022111211102122212 |
4 | 10212020311112333113001 |
5 | 10122132221344022423 |
6 | 110553421301511505 |
7 | 4154225156225162 |
oct | 446106526772701 |
9 | 78510274742585 |
10 | 20213011314113 |
11 | 6493320a310a2 |
12 | 2325500712595 |
13 | b38104136637 |
14 | 4dc45a3b1769 |
15 | 250bc0744578 |
hex | 1262355bf5c1 |
20213011314113 has 2 divisors, whose sum is σ = 20213011314114. Its totient is φ = 20213011314112.
The previous prime is 20213011314109. The next prime is 20213011314127. The reversal of 20213011314113 is 31141311031202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14616460629904 + 5596550684209 = 3823148^2 + 2365703^2 .
It is a cyclic number.
It is not a de Polignac number, because 20213011314113 - 22 = 20213011314109 is a prime.
It is not a weakly prime, because it can be changed into another prime (20213011310113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10106505657056 + 10106505657057.
It is an arithmetic number, because the mean of its divisors is an integer number (10106505657057).
Almost surely, 220213011314113 is an apocalyptic number.
It is an amenable number.
20213011314113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20213011314113 is an equidigital number, since it uses as much as digits as its factorization.
20213011314113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 20213011314113 its reverse (31141311031202), we get a palindrome (51354322345315).
The spelling of 20213011314113 in words is "twenty trillion, two hundred thirteen billion, eleven million, three hundred fourteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •