Base | Representation |
---|---|
bin | 100110010111… |
… | …010100001010 |
3 | 200220221120101 |
4 | 212113110022 |
5 | 10033310340 |
6 | 555320014 |
7 | 151324420 |
oct | 46272412 |
9 | 20827511 |
10 | 10056970 |
11 | 5749a50 |
12 | 345000a |
13 | 2111791 |
14 | 149b110 |
15 | d39c9a |
hex | 99750a |
10056970 has 64 divisors (see below), whose sum is σ = 23245056. Its totient is φ = 3041280.
The previous prime is 10056967. The next prime is 10056973. The reversal of 10056970 is 7965001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10056967) and next prime (10056973).
It is a super-2 number, since 2×100569702 = 202285291161800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10056973) 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 31 ways as a sum of consecutive naturals, for example, 28314 + ... + 28666.
It is an arithmetic number, because the mean of its divisors is an integer number (363204).
Almost surely, 210056970 is an apocalyptic number.
10056970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10056970 is an abundant number, since it is smaller than the sum of its proper divisors (13188086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10056970 is a wasteful number, since it uses less digits than its factorization.
10056970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415.
The product of its (nonzero) digits is 1890, while the sum is 28.
The square root of 10056970 is about 3171.2726152130. The cubic root of 10056970 is about 215.8518216681.
It can be divided in two parts, 10056 and 970, that added together give a triangular number (11026 = T148).
The spelling of 10056970 in words is "ten million, fifty-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •