Base | Representation |
---|---|
bin | 110000110001001011… |
… | …0011101011100110110 |
3 | 101000022202121011011110 |
4 | 1201202112131130312 |
5 | 3203441143120240 |
6 | 120040103415450 |
7 | 10365201051615 |
oct | 1414226353466 |
9 | 330282534143 |
10 | 104729270070 |
11 | 40462a40767 |
12 | 18369754586 |
13 | 9b5054b1b9 |
14 | 50d71ab87c |
15 | 2ace514c80 |
hex | 186259d736 |
104729270070 has 32 divisors (see below), whose sum is σ = 251641562112. Its totient is φ = 27895437152.
The previous prime is 104729270003. The next prime is 104729270071. The reversal of 104729270070 is 70072927401.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104729270071) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1996692 + ... + 2048471.
It is an arithmetic number, because the mean of its divisors is an integer number (7863798816).
Almost surely, 2104729270070 is an apocalyptic number.
104729270070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104729270070 is an abundant number, since it is smaller than the sum of its proper divisors (146912292042).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104729270070 is a wasteful number, since it uses less digits than its factorization.
104729270070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4046036.
The product of its (nonzero) digits is 49392, while the sum is 39.
The spelling of 104729270070 in words is "one hundred four billion, seven hundred twenty-nine million, two hundred seventy thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •