Base | Representation |
---|---|
bin | 101000000111000010110… |
… | …0001100111000100100000 |
3 | 201112000012101001020102000 |
4 | 1100032011201213010200 |
5 | 1210304433401040110 |
6 | 15420254113124000 |
7 | 1106164300145154 |
oct | 120160541470440 |
9 | 21460171036360 |
10 | 5512683221280 |
11 | 1835a08a65914 |
12 | 75048a559600 |
13 | 30cac7a8cab1 |
14 | 150b5b235064 |
15 | 985e6a811c0 |
hex | 50385867120 |
5512683221280 has 384 divisors, whose sum is σ = 19447998393600. Its totient is φ = 1458361884672.
The previous prime is 5512683221273. The next prime is 5512683221321. The reversal of 5512683221280 is 821223862155.
5512683221280 is a `hidden beast` number, since 5 + 51 + 26 + 83 + 221 + 280 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
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, 1052638822 + ... + 1052644058.
It is an arithmetic number, because the mean of its divisors is an integer number (50645829150).
Almost surely, 25512683221280 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5512683221280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9723999196800).
5512683221280 is an abundant number, since it is smaller than the sum of its proper divisors (13935315172320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5512683221280 is a wasteful number, since it uses less digits than its factorization.
5512683221280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7153 (or 7139 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 45.
The spelling of 5512683221280 in words is "five trillion, five hundred twelve billion, six hundred eighty-three million, two hundred twenty-one thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •