Base | Representation |
---|---|
bin | 11110101101010010011… |
… | …001110110110111111101 |
3 | 21110201211021010201112000 |
4 | 132231102121312313331 |
5 | 234033203112434123 |
6 | 4253230122532513 |
7 | 305313002251611 |
oct | 36552231666775 |
9 | 7421737121460 |
10 | 2110211452413 |
11 | 743a32396259 |
12 | 2a0b81667139 |
13 | 123cb87c823c |
14 | 741c5b97341 |
15 | 39d58942b43 |
hex | 1eb52676dfd |
2110211452413 has 16 divisors (see below), whose sum is σ = 3155456381760. Its totient is φ = 1393659898128.
The previous prime is 2110211452411. The next prime is 2110211452439. The reversal of 2110211452413 is 3142541120112.
2110211452413 is a `hidden beast` number, since 2 + 1 + 10 + 2 + 114 + 524 + 13 = 666.
It is not a de Polignac number, because 2110211452413 - 21 = 2110211452411 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110211452411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 365211970 + ... + 365217747.
It is an arithmetic number, because the mean of its divisors is an integer number (197216023860).
Almost surely, 22110211452413 is an apocalyptic number.
It is an amenable number.
2110211452413 is a deficient number, since it is larger than the sum of its proper divisors (1045244929347).
2110211452413 is a wasteful number, since it uses less digits than its factorization.
2110211452413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 730429833 (or 730429827 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 2110211452413 its reverse (3142541120112), we get a palindrome (5252752572525).
The spelling of 2110211452413 in words is "two trillion, one hundred ten billion, two hundred eleven million, four hundred fifty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •