Base | Representation |
---|---|
bin | 100011001110110000000… |
… | …110111101001100111101 |
3 | 22120110002010111212220210 |
4 | 203032300012331030331 |
5 | 304131222411414323 |
6 | 5052111330303033 |
7 | 336625106445006 |
oct | 43166006751475 |
9 | 8513063455823 |
10 | 2421021201213 |
11 | 85382739684a |
12 | 331263127a79 |
13 | 1473bbccb5c4 |
14 | 8526c8041ad |
15 | 42e9a110293 |
hex | 233b01bd33d |
2421021201213 has 16 divisors (see below), whose sum is σ = 3339384871680. Its totient is φ = 1558337342016.
The previous prime is 2421021201191. The next prime is 2421021201233. The reversal of 2421021201213 is 3121021201242.
It is a happy number.
It is not a de Polignac number, because 2421021201213 - 241 = 221997945661 is a prime.
It is a super-2 number, since 2×24210212012132 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2421021201213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2421021201233) 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, 8606556 + ... + 8883402.
It is an arithmetic number, because the mean of its divisors is an integer number (208711554480).
Almost surely, 22421021201213 is an apocalyptic number.
It is an amenable number.
2421021201213 is a deficient number, since it is larger than the sum of its proper divisors (918363670467).
2421021201213 is a wasteful number, since it uses less digits than its factorization.
2421021201213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377396.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 2421021201213 its reverse (3121021201242), we get a palindrome (5542042402455).
The spelling of 2421021201213 in words is "two trillion, four hundred twenty-one billion, twenty-one million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •