Base | Representation |
---|---|
bin | 101000010000… |
… | …001010100010 |
3 | 201212002120201 |
4 | 220100022202 |
5 | 10200130340 |
6 | 1014055414 |
7 | 155455522 |
oct | 50201242 |
9 | 21762521 |
10 | 10551970 |
11 | 5a57940 |
12 | 364a56a |
13 | 2255b90 |
14 | 1589682 |
15 | dd679a |
hex | a102a2 |
10551970 has 64 divisors (see below), whose sum is σ = 22934016. Its totient is φ = 3444480.
The previous prime is 10551953. The next prime is 10551977. The reversal of 10551970 is 7915501.
It is a super-2 number, since 2×105519702 = 222688141761800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10551977) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 67132 + ... + 67288.
It is an arithmetic number, because the mean of its divisors is an integer number (358344).
Almost surely, 210551970 is an apocalyptic number.
10551970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10551970 is an abundant number, since it is smaller than the sum of its proper divisors (12382046).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10551970 is a wasteful number, since it uses less digits than its factorization.
10551970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235.
The product of its (nonzero) digits is 1575, while the sum is 28.
The square root of 10551970 is about 3248.3795960448. The cubic root of 10551970 is about 219.3366381516.
It can be divided in two parts, 1055 and 1970, that added together give a square (3025 = 552).
The spelling of 10551970 in words is "ten million, five hundred fifty-one thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •