Base | Representation |
---|---|
bin | 10011001100010100… |
… | …00110000101001010 |
3 | 222121002112011112020 |
4 | 21212022012011022 |
5 | 132100241410340 |
6 | 4422235225310 |
7 | 513224224221 |
oct | 114612060512 |
9 | 28532464466 |
10 | 10303856970 |
11 | 4408293280 |
12 | 1bb68a8236 |
13 | c829389b4 |
14 | 6da65bcb8 |
15 | 4048ce9d0 |
hex | 26628614a |
10303856970 has 64 divisors (see below), whose sum is σ = 27380077056. Its totient is φ = 2460617280.
The previous prime is 10303856957. The next prime is 10303856987. The reversal of 10303856970 is 7965830301.
It is a Curzon number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 210904 + ... + 255123.
It is an arithmetic number, because the mean of its divisors is an integer number (427813704).
Almost surely, 210303856970 is an apocalyptic number.
10303856970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10303856970 is an abundant number, since it is smaller than the sum of its proper divisors (17076220086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10303856970 is a wasteful number, since it uses less digits than its factorization.
10303856970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466115.
The product of its (nonzero) digits is 136080, while the sum is 42.
The spelling of 10303856970 in words is "ten billion, three hundred three million, eight hundred fifty-six thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •