Base | Representation |
---|---|
bin | 1011100000101001101000… |
… | …0001001010011111100000 |
3 | 1122210212012120110020000020 |
4 | 2320022122001022133200 |
5 | 3124322040224303100 |
6 | 42525514413353440 |
7 | 2444222342054460 |
oct | 270123201123740 |
9 | 48725176406006 |
10 | 12655557650400 |
11 | 403a212400455 |
12 | 1504894798880 |
13 | 70a54c637132 |
14 | 31a764735ba0 |
15 | 16e3004de5a0 |
hex | b829a04a7e0 |
12655557650400 has 432 divisors, whose sum is σ = 49686935082624. Its totient is φ = 2740450268160.
The previous prime is 12655557650377. The next prime is 12655557650429. The reversal of 12655557650400 is 405675555621.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 5021439 + ... + 7108161.
It is an arithmetic number, because the mean of its divisors is an integer number (115016053432).
Almost surely, 212655557650400 is an apocalyptic number.
12655557650400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12655557650400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24843467541312).
12655557650400 is an abundant number, since it is smaller than the sum of its proper divisors (37031377432224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12655557650400 is a wasteful number, since it uses less digits than its factorization.
12655557650400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2086791 (or 2086759 counting only the distinct ones).
The product of its (nonzero) digits is 6300000, while the sum is 51.
The spelling of 12655557650400 in words is "twelve trillion, six hundred fifty-five billion, five hundred fifty-seven million, six hundred fifty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •