Base | Representation |
---|---|
bin | 100101010001100110111… |
… | …1011111001110010000000 |
3 | 200010202111120210010102000 |
4 | 1022203031323321302000 |
5 | 1132414004322034110 |
6 | 14521255514424000 |
7 | 1036062050631201 |
oct | 112431573716200 |
9 | 20122446703360 |
10 | 5123056049280 |
11 | 16a5748644744 |
12 | 6a8a71132000 |
13 | 2b2143458800 |
14 | 139d589255a8 |
15 | 8d3e0b3d1c0 |
hex | 4a8cdef9c80 |
5123056049280 has 1536 divisors, whose sum is σ = 20755994688000. Its totient is φ = 1191286407168.
The previous prime is 5123056049227. The next prime is 5123056049323. The reversal of 5123056049280 is 829406503215.
5123056049280 is a `hidden beast` number, since 5 + 1 + 2 + 3 + 0 + 560 + 4 + 9 + 2 + 80 = 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 191 ways as a sum of consecutive naturals, for example, 5977894612 + ... + 5977895468.
It is an arithmetic number, because the mean of its divisors is an integer number (13513017375).
Almost surely, 25123056049280 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 5123056049280, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10377997344000).
5123056049280 is an abundant number, since it is smaller than the sum of its proper divisors (15632938638720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5123056049280 is a wasteful number, since it uses less digits than its factorization.
5123056049280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1023 (or 992 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 45.
The spelling of 5123056049280 in words is "five trillion, one hundred twenty-three billion, fifty-six million, forty-nine thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •