Base | Representation |
---|---|
bin | 1100010100111110011011… |
… | …0101101100001010000000 |
3 | 1202222210112001000110000120 |
4 | 3011033212311230022000 |
5 | 3234034101112344211 |
6 | 44454503205220240 |
7 | 2566165004364420 |
oct | 305174665541200 |
9 | 52883461013016 |
10 | 13554494653056 |
11 | 4356479959645 |
12 | 162ab50a01680 |
13 | 77424cac9a16 |
14 | 34c080892480 |
15 | 1878b4543d06 |
hex | c53e6d6c280 |
13554494653056 has 512 divisors, whose sum is σ = 43568485632000. Its totient is φ = 3647333007360.
The previous prime is 13554494653033. The next prime is 13554494653103. The reversal of 13554494653056 is 65035649445531.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8424172380 + ... + 8424173988.
It is an arithmetic number, because the mean of its divisors is an integer number (85094698500).
Almost surely, 213554494653056 is an apocalyptic number.
13554494653056 is a gapful number since it is divisible by the number (16) 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 13554494653056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21784242816000).
13554494653056 is an abundant number, since it is smaller than the sum of its proper divisors (30013990978944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13554494653056 is a wasteful number, since it uses less digits than its factorization.
13554494653056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2520 (or 2508 counting only the distinct ones).
The product of its (nonzero) digits is 116640000, while the sum is 60.
The spelling of 13554494653056 in words is "thirteen trillion, five hundred fifty-four billion, four hundred ninety-four million, six hundred fifty-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •