Base | Representation |
---|---|
bin | 1010000000101011000000… |
… | …10011110100101010111101 |
3 | 2212221110020100021002210121 |
4 | 11000111200103310222331 |
5 | 10341131241214414323 |
6 | 114452440413334541 |
7 | 4431260445615121 |
oct | 500254023645275 |
9 | 85843210232717 |
10 | 22013323201213 |
11 | 7017886074113 |
12 | 25763b5497451 |
13 | c38b02b7c106 |
14 | 561644369581 |
15 | 28293c858a5d |
hex | 1405604f4abd |
22013323201213 has 2 divisors, whose sum is σ = 22013323201214. Its totient is φ = 22013323201212.
The previous prime is 22013323201171. The next prime is 22013323201217. The reversal of 22013323201213 is 31210232331022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20069342733924 + 1943980467289 = 4479882^2 + 1394267^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22013323201213 is a prime.
It is a super-2 number, since 2×220133232012132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22013323201217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006661600606 + 11006661600607.
It is an arithmetic number, because the mean of its divisors is an integer number (11006661600607).
Almost surely, 222013323201213 is an apocalyptic number.
It is an amenable number.
22013323201213 is a deficient number, since it is larger than the sum of its proper divisors (1).
22013323201213 is an equidigital number, since it uses as much as digits as its factorization.
22013323201213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 22013323201213 its reverse (31210232331022), we get a palindrome (53223555532235).
The spelling of 22013323201213 in words is "twenty-two trillion, thirteen billion, three hundred twenty-three million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •