Base | Representation |
---|---|
bin | 1001011110000001… |
… | …00110001110001000 |
3 | 111010021210022220110 |
4 | 10233000212032020 |
5 | 40402403344000 |
6 | 2200240154320 |
7 | 236656223526 |
oct | 45700461610 |
9 | 14107708813 |
10 | 5083653000 |
11 | 2179653818 |
12 | b9a6089a0 |
13 | 63029a8ca |
14 | 363239316 |
15 | 1eb47c850 |
hex | 12f026388 |
5083653000 has 64 divisors (see below), whose sum is σ = 15861006720. Its totient is φ = 1355640000.
The previous prime is 5083652989. The next prime is 5083653011. The reversal of 5083653000 is 3563805.
It is an interprime number because it is at equal distance from previous prime (5083652989) and next prime (5083653011).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 844276 + ... + 850275.
It is an arithmetic number, because the mean of its divisors is an integer number (247828230).
Almost surely, 25083653000 is an apocalyptic number.
5083653000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5083653000 is an abundant number, since it is smaller than the sum of its proper divisors (10777353720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5083653000 is a wasteful number, since it uses less digits than its factorization.
5083653000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1694575 (or 1694561 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The square root of 5083653000 is about 71299.7405324872. The cubic root of 5083653000 is about 1719.4595606919.
The spelling of 5083653000 in words is "five billion, eighty-three million, six hundred fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •