Base | Representation |
---|---|
bin | 1011001000100001010110… |
… | …1010011111010000010000 |
3 | 1121100020012202012120001220 |
4 | 2302020111222133100100 |
5 | 3101024102141100300 |
6 | 42011240322325040 |
7 | 2402245615243314 |
oct | 262102552372020 |
9 | 47306182176056 |
10 | 12241020253200 |
11 | 399a4298a0402 |
12 | 1458484ab9780 |
13 | 6aa42826cc1b |
14 | 30467b96bb44 |
15 | 16363c70dda0 |
hex | b2215a9f410 |
12241020253200 has 60 divisors (see below), whose sum is σ = 39212068214928. Its totient is φ = 3264272067200.
The previous prime is 12241020253199. The next prime is 12241020253219. The reversal of 12241020253200 is 235202014221.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×122410202532002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5100423906 + ... + 5100426305.
Almost surely, 212241020253200 is an apocalyptic number.
12241020253200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12241020253200 is an abundant number, since it is smaller than the sum of its proper divisors (26971047961728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12241020253200 is a wasteful number, since it uses less digits than its factorization.
12241020253200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10200850232 (or 10200850221 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 24.
Adding to 12241020253200 its reverse (235202014221), we get a palindrome (12476222267421).
The spelling of 12241020253200 in words is "twelve trillion, two hundred forty-one billion, twenty million, two hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •