Base | Representation |
---|---|
bin | 11110100101110110010… |
… | …000010101010110110101 |
3 | 21102222012112110100022122 |
4 | 132211312100111112311 |
5 | 233420323042013023 |
6 | 4245425314405325 |
7 | 304611021451052 |
oct | 36456620252665 |
9 | 7388175410278 |
10 | 2102223001013 |
11 | 740603096503 |
12 | 29b512290845 |
13 | 123314799815 |
14 | 73a68c58029 |
15 | 39a3c4792c8 |
hex | 1e9764155b5 |
2102223001013 has 2 divisors, whose sum is σ = 2102223001014. Its totient is φ = 2102223001012.
The previous prime is 2102223001007. The next prime is 2102223001051. The reversal of 2102223001013 is 3101003222012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1489944920689 + 612278080324 = 1220633^2 + 782482^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2102223001013 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2102223000982 and 2102223001000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2102223001213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1051111500506 + 1051111500507.
It is an arithmetic number, because the mean of its divisors is an integer number (1051111500507).
Almost surely, 22102223001013 is an apocalyptic number.
It is an amenable number.
2102223001013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2102223001013 is an equidigital number, since it uses as much as digits as its factorization.
2102223001013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 2102223001013 its reverse (3101003222012), we get a palindrome (5203226223025).
The spelling of 2102223001013 in words is "two trillion, one hundred two billion, two hundred twenty-three million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •