Base | Representation |
---|---|
bin | 11110101101000110101… |
… | …001111010100000101101 |
3 | 21110201022112020010021212 |
4 | 132231012221322200231 |
5 | 234032302132210041 |
6 | 4253154402004205 |
7 | 305305056631415 |
oct | 36550651724055 |
9 | 7421275203255 |
10 | 2110014335021 |
11 | 7439410a201a |
12 | 2a0b27646665 |
13 | 123c86a10028 |
14 | 741a7925645 |
15 | 39d464a78eb |
hex | 1eb46a7a82d |
2110014335021 has 2 divisors, whose sum is σ = 2110014335022. Its totient is φ = 2110014335020.
The previous prime is 2110014335003. The next prime is 2110014335041. The reversal of 2110014335021 is 1205334100112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1275374955625 + 834639379396 = 1129325^2 + 913586^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110014335021 - 238 = 1835136428077 is a prime.
It is a super-2 number, since 2×21100143350212 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110014335041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055007167510 + 1055007167511.
It is an arithmetic number, because the mean of its divisors is an integer number (1055007167511).
Almost surely, 22110014335021 is an apocalyptic number.
It is an amenable number.
2110014335021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110014335021 is an equidigital number, since it uses as much as digits as its factorization.
2110014335021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 2110014335021 its reverse (1205334100112), we get a palindrome (3315348435133).
The spelling of 2110014335021 in words is "two trillion, one hundred ten billion, fourteen million, three hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •