Base | Representation |
---|---|
bin | 100001100111010110101… |
… | …111100010001111101101 |
3 | 22011211111212221212000201 |
4 | 201213112233202033231 |
5 | 300321340024120323 |
6 | 4525111025353501 |
7 | 325614646632214 |
oct | 41472657421755 |
9 | 8154455855021 |
10 | 2310000223213 |
11 | 8107359a4871 |
12 | 31383a498891 |
13 | 139aa812ac07 |
14 | 7db39bb207b |
15 | 4014d5908ad |
hex | 219d6be23ed |
2310000223213 has 2 divisors, whose sum is σ = 2310000223214. Its totient is φ = 2310000223212.
The previous prime is 2310000223211. The next prime is 2310000223217. The reversal of 2310000223213 is 3123220000132.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1866781155204 + 443219068009 = 1366302^2 + 665747^2 .
It is a cyclic number.
It is not a de Polignac number, because 2310000223213 - 21 = 2310000223211 is a prime.
It is a super-2 number, since 2×23100002232132 (a number of 26 digits) contains 22 as substring.
Together with 2310000223211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2310000223211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1155000111606 + 1155000111607.
It is an arithmetic number, because the mean of its divisors is an integer number (1155000111607).
Almost surely, 22310000223213 is an apocalyptic number.
It is an amenable number.
2310000223213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2310000223213 is an equidigital number, since it uses as much as digits as its factorization.
2310000223213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2310000223213 its reverse (3123220000132), we get a palindrome (5433220223345).
The spelling of 2310000223213 in words is "two trillion, three hundred ten billion, two hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •