Base | Representation |
---|---|
bin | 1100010011100110010101… |
… | …0011101010110000000000 |
3 | 1202220112110222002202121010 |
4 | 3010321211103222300000 |
5 | 3233142133214341211 |
6 | 44435552442200520 |
7 | 2564366664513360 |
oct | 304714523526000 |
9 | 52815428082533 |
10 | 13530846637056 |
11 | 43474441a6171 |
12 | 16264511b3140 |
13 | 771c516cc948 |
14 | 34ac79cbc9a0 |
15 | 186e7d3ce4a6 |
hex | c4e654eac00 |
13530846637056 has 704 divisors, whose sum is σ = 45236521598976. Its totient is φ = 3510853632000.
The previous prime is 13530846637039. The next prime is 13530846637093. The reversal of 13530846637056 is 65073664803531.
It is a junction number, because it is equal to n+sod(n) for n = 13530846636987 and 13530846637005.
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, 812606331 + ... + 812622981.
Almost surely, 213530846637056 is an apocalyptic number.
13530846637056 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 13530846637056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22618260799488).
13530846637056 is an abundant number, since it is smaller than the sum of its proper divisors (31705674961920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13530846637056 is a wasteful number, since it uses less digits than its factorization.
13530846637056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16788 (or 16770 counting only the distinct ones).
The product of its (nonzero) digits is 32659200, while the sum is 57.
The spelling of 13530846637056 in words is "thirteen trillion, five hundred thirty billion, eight hundred forty-six million, six hundred thirty-seven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •