Base | Representation |
---|---|
bin | 1001011010100111… |
… | …10101110010000000 |
3 | 111001022010212121000 |
4 | 10231103311302000 |
5 | 40323104034130 |
6 | 2153341132000 |
7 | 236162002233 |
oct | 45523656200 |
9 | 14038125530 |
10 | 5055143040 |
11 | 2164550872 |
12 | b90b5a000 |
13 | 6273c7bcc |
14 | 35d53741a |
15 | 1e8bea260 |
hex | 12d4f5c80 |
5055143040 has 512 divisors, whose sum is σ = 19167840000. Its totient is φ = 1255440384.
The previous prime is 5055143039. The next prime is 5055143047. The reversal of 5055143040 is 403415505.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 5055142995 and 5055143013.
It is not an unprimeable number, because it can be changed into a prime (5055143047) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 29220394 + ... + 29220566.
Almost surely, 25055143040 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 5055143040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9583920000).
5055143040 is an abundant number, since it is smaller than the sum of its proper divisors (14112696960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5055143040 is a wasteful number, since it uses less digits than its factorization.
5055143040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 309 (or 291 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 5055143040 is about 71099.5291123647. The cubic root of 5055143040 is about 1716.2391959587.
Adding to 5055143040 its reverse (403415505), we get a palindrome (5458558545).
The spelling of 5055143040 in words is "five billion, fifty-five million, one hundred forty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •