Base | Representation |
---|---|
bin | 11001000010100… |
… | …111001101100100 |
3 | 1002021112001211221 |
4 | 121002213031210 |
5 | 1330022142200 |
6 | 105404310124 |
7 | 13260630643 |
oct | 3102471544 |
9 | 1067461757 |
10 | 420115300 |
11 | 1a6164930 |
12 | b8842344 |
13 | 69065347 |
14 | 3db1d35a |
15 | 26d3891a |
hex | 190a7364 |
420115300 has 72 divisors (see below), whose sum is σ = 997748640. Its totient is φ = 152275200.
The previous prime is 420115291. The next prime is 420115303. The reversal of 420115300 is 3511024.
It is not an unprimeable number, because it can be changed into a prime (420115303) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 678391 + ... + 679009.
It is an arithmetic number, because the mean of its divisors is an integer number (13857620).
Almost surely, 2420115300 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 420115300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (498874320).
420115300 is an abundant number, since it is smaller than the sum of its proper divisors (577633340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
420115300 is a wasteful number, since it uses less digits than its factorization.
420115300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1261 (or 1254 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 420115300 is about 20496.7143708449. The cubic root of 420115300 is about 748.9557615777.
Adding to 420115300 its reverse (3511024), we get a palindrome (423626324).
The spelling of 420115300 in words is "four hundred twenty million, one hundred fifteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •