Base | Representation |
---|---|
bin | 1001100111011001111001… |
… | …01100010010111110110101 |
3 | 2202212110022022121211111210 |
4 | 10303230330230102332311 |
5 | 10232420222403241003 |
6 | 112545535542352033 |
7 | 4311454223340030 |
oct | 463547454227665 |
9 | 82773268554453 |
10 | 21145142243253 |
11 | 68126715a8586 |
12 | 24560a142b619 |
13 | ba4c945b4542 |
14 | 531604c20017 |
15 | 26a0789c1503 |
hex | 133b3cb12fb5 |
21145142243253 has 32 divisors (see below), whose sum is σ = 32704752050176. Its totient is φ = 11901624280128.
The previous prime is 21145142243227. The next prime is 21145142243279. The reversal of 21145142243253 is 35234224154112.
It is an interprime number because it is at equal distance from previous prime (21145142243227) and next prime (21145142243279).
It is not a de Polignac number, because 21145142243253 - 28 = 21145142242997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21145142243153) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 16801500 + ... + 18016122.
It is an arithmetic number, because the mean of its divisors is an integer number (1022023501568).
Almost surely, 221145142243253 is an apocalyptic number.
It is an amenable number.
21145142243253 is a deficient number, since it is larger than the sum of its proper divisors (11559609806923).
21145142243253 is a wasteful number, since it uses less digits than its factorization.
21145142243253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1227073.
The product of its digits is 230400, while the sum is 39.
Adding to 21145142243253 its reverse (35234224154112), we get a palindrome (56379366397365).
The spelling of 21145142243253 in words is "twenty-one trillion, one hundred forty-five billion, one hundred forty-two million, two hundred forty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •