Base | Representation |
---|---|
bin | 10010110101010000… |
… | …11111110011100110 |
3 | 222002121200121201120 |
4 | 21122220133303212 |
5 | 131201242000240 |
6 | 4351131034410 |
7 | 505355555406 |
oct | 113250376346 |
9 | 28077617646 |
10 | 10110500070 |
11 | 4319128390 |
12 | 1b61b9ba06 |
13 | c51869328 |
14 | 6bcac8806 |
15 | 3e2938ad0 |
hex | 25aa1fce6 |
10110500070 has 64 divisors (see below), whose sum is σ = 26481758976. Its totient is φ = 2450046080.
The previous prime is 10110500047. The next prime is 10110500089. The reversal of 10110500070 is 7000501101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1139692 + ... + 1148528.
It is an arithmetic number, because the mean of its divisors is an integer number (413777484).
Almost surely, 210110500070 is an apocalyptic number.
10110500070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10110500070 is an abundant number, since it is smaller than the sum of its proper divisors (16371258906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110500070 is a wasteful number, since it uses less digits than its factorization.
10110500070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12325.
The product of its (nonzero) digits is 35, while the sum is 15.
The spelling of 10110500070 in words is "ten billion, one hundred ten million, five hundred thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •