Base | Representation |
---|---|
bin | 1001010111110001… |
… | …00010110100111100 |
3 | 110222122002222001020 |
4 | 10223320202310330 |
5 | 40300442212200 |
6 | 2151124144140 |
7 | 235451403414 |
oct | 45370426474 |
9 | 13878088036 |
10 | 5031210300 |
11 | 2151a94846 |
12 | b84b38050 |
13 | 62246871c |
14 | 35a2a7644 |
15 | 1e6a6dea0 |
hex | 12be22d3c |
5031210300 has 36 divisors (see below), whose sum is σ = 14556969336. Its totient is φ = 1341656000.
The previous prime is 5031210257. The next prime is 5031210347. The reversal of 5031210300 is 30121305.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 5031210300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8385051 + ... + 8385650.
Almost surely, 25031210300 is an apocalyptic number.
5031210300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5031210300 is an abundant number, since it is smaller than the sum of its proper divisors (9525759036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5031210300 is a wasteful number, since it uses less digits than its factorization.
5031210300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16770718 (or 16770711 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 5031210300 is about 70931.0249467749. The cubic root of 5031210300 is about 1713.5264934695.
Adding to 5031210300 its reverse (30121305), we get a palindrome (5061331605).
The spelling of 5031210300 in words is "five billion, thirty-one million, two hundred ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •