Base | Representation |
---|---|
bin | 1100001111001100001110… |
… | …1011011101001101000000 |
3 | 1202122022000111001102211001 |
4 | 3003303003223131031000 |
5 | 3230422041323120000 |
6 | 44341110320501344 |
7 | 2556046300241035 |
oct | 303630353351500 |
9 | 52568014042731 |
10 | 13455120520000 |
11 | 4318314839655 |
12 | 161383877a854 |
13 | 767a73b71863 |
14 | 3473349cd38c |
15 | 184eea23646a |
hex | c3cc3add340 |
13455120520000 has 280 divisors, whose sum is σ = 35555806699776. Its totient is φ = 5038497024000.
The previous prime is 13455120519983. The next prime is 13455120520027. The reversal of 13455120520000 is 2502155431.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 43084414 + ... + 43395586.
Almost surely, 213455120520000 is an apocalyptic number.
13455120520000 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 13455120520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17777903349888).
13455120520000 is an abundant number, since it is smaller than the sum of its proper divisors (22100686179776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13455120520000 is an equidigital number, since it uses as much as digits as its factorization.
13455120520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 311275 (or 311250 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 13455120520000 its reverse (2502155431), we get a palindrome (13457622675431).
The spelling of 13455120520000 in words is "thirteen trillion, four hundred fifty-five billion, one hundred twenty million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •