Base | Representation |
---|---|
bin | 100111010010… |
… | …111011000000 |
3 | 201101100110222 |
4 | 213102323000 |
5 | 10114113440 |
6 | 1004442212 |
7 | 153362264 |
oct | 47227300 |
9 | 21340428 |
10 | 10301120 |
11 | 58a6425 |
12 | 3549368 |
13 | 219894b |
14 | 15220a4 |
15 | d872b5 |
hex | 9d2ec0 |
10301120 has 28 divisors (see below), whose sum is σ = 24530304. Its totient is φ = 4120320.
The previous prime is 10301117. The next prime is 10301129. The reversal of 10301120 is 2110301.
It is a super-2 number, since 2×103011202 = 212226146508800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a junction number, because it is equal to n+sod(n) for n = 10301098 and 10301107.
It is not an unprimeable number, because it can be changed into a prime (10301129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15776 + ... + 16415.
Almost surely, 210301120 is an apocalyptic number.
10301120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10301120 is an abundant number, since it is smaller than the sum of its proper divisors (14229184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10301120 is an equidigital number, since it uses as much as digits as its factorization.
10301120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32208 (or 32198 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 10301120 is about 3209.5357919799. The cubic root of 10301120 is about 217.5845973815.
Adding to 10301120 its reverse (2110301), we get a palindrome (12411421).
The spelling of 10301120 in words is "ten million, three hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •