Base | Representation |
---|---|
bin | 11110101100111110001… |
… | …101011011111100010101 |
3 | 21110200221122121212210112 |
4 | 132230332031123330111 |
5 | 234032004344331203 |
6 | 4253132341132405 |
7 | 305301416431505 |
oct | 36547615337425 |
9 | 7420848555715 |
10 | 2109872652053 |
11 | 743879120561 |
12 | 2a0aa80ba105 |
13 | 123c6356395a |
14 | 74192ba3a05 |
15 | 39d38d1c6d8 |
hex | 1eb3e35bf15 |
2109872652053 has 2 divisors, whose sum is σ = 2109872652054. Its totient is φ = 2109872652052.
The previous prime is 2109872652037. The next prime is 2109872652089. The reversal of 2109872652053 is 3502562789012.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1618742200804 + 491130451249 = 1272298^2 + 700807^2 .
It is a cyclic number.
It is not a de Polignac number, because 2109872652053 - 24 = 2109872652037 is a prime.
It is a super-2 number, since 2×21098726520532 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2109872651992 and 2109872652010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2109872655053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1054936326026 + 1054936326027.
It is an arithmetic number, because the mean of its divisors is an integer number (1054936326027).
Almost surely, 22109872652053 is an apocalyptic number.
It is an amenable number.
2109872652053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2109872652053 is an equidigital number, since it uses as much as digits as its factorization.
2109872652053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1814400, while the sum is 50.
The spelling of 2109872652053 in words is "two trillion, one hundred nine billion, eight hundred seventy-two million, six hundred fifty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •