Base | Representation |
---|---|
bin | 1011001110011011000100… |
… | …0001111111110111110000 |
3 | 1121200220220212000212220001 |
4 | 2303212301001333313300 |
5 | 3104204224222214100 |
6 | 42130005252555344 |
7 | 2412465311426236 |
oct | 263466101776760 |
9 | 47626825025801 |
10 | 12342411132400 |
11 | 3a29429355648 |
12 | 1474060622b54 |
13 | 6b6b65c867bb |
14 | 309539608956 |
15 | 1660c3adad6a |
hex | b39b107fdf0 |
12342411132400 has 60 divisors (see below), whose sum is σ = 29659309042104. Its totient is φ = 4935854560000.
The previous prime is 12342411132367. The next prime is 12342411132409. The reversal of 12342411132400 is 423111424321.
It is a happy number.
It is a super-2 number, since 2×123424111324002 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12342411132409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1685791 + ... + 5246590.
Almost surely, 212342411132400 is an apocalyptic number.
12342411132400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12342411132400 is an abundant number, since it is smaller than the sum of its proper divisors (17316897909704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12342411132400 is a wasteful number, since it uses less digits than its factorization.
12342411132400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6936850 (or 6936839 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 12342411132400 its reverse (423111424321), we get a palindrome (12765522556721).
The spelling of 12342411132400 in words is "twelve trillion, three hundred forty-two billion, four hundred eleven million, one hundred thirty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •