Base | Representation |
---|---|
bin | 1011010011000000110001… |
… | …1010001100101101111100 |
3 | 1121222110102112001221210012 |
4 | 2310300030122030231330 |
5 | 3112002211411130320 |
6 | 42230124541002352 |
7 | 2421256146446045 |
oct | 264601432145574 |
9 | 47873375057705 |
10 | 12421253614460 |
11 | 3a59907931329 |
12 | 14873a48533b8 |
13 | 6c141c34c652 |
14 | 30d2987518cc |
15 | 16818a6614c5 |
hex | b4c0c68cb7c |
12421253614460 has 24 divisors (see below), whose sum is σ = 26097655456656. Its totient is φ = 4966020899840.
The previous prime is 12421253614433. The next prime is 12421253614481. The reversal of 12421253614460 is 6441635212421.
It is a super-2 number, since 2×124212536144602 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154993061 + ... + 155073180.
It is an arithmetic number, because the mean of its divisors is an integer number (1087402310694).
Almost surely, 212421253614460 is an apocalyptic number.
12421253614460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12421253614460 is an abundant number, since it is smaller than the sum of its proper divisors (13676401842196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12421253614460 is a wasteful number, since it uses less digits than its factorization.
12421253614460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310068253 (or 310068251 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 41.
Adding to 12421253614460 its reverse (6441635212421), we get a palindrome (18862888826881).
The spelling of 12421253614460 in words is "twelve trillion, four hundred twenty-one billion, two hundred fifty-three million, six hundred fourteen thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •