Base | Representation |
---|---|
bin | 100101001111111110… |
… | …100010100001100110 |
3 | 10211020102110201111110 |
4 | 211033332202201212 |
5 | 1123403101000240 |
6 | 30212451445450 |
7 | 2614102432632 |
oct | 451776424146 |
9 | 124212421443 |
10 | 39996500070 |
11 | 15a64a8853a |
12 | 79028b6886 |
13 | 3a054284b7 |
14 | 1d15d39dc2 |
15 | 1091544c80 |
hex | 94ffa2866 |
39996500070 has 16 divisors (see below), whose sum is σ = 95991600240. Its totient is φ = 10665733344.
The previous prime is 39996500059. The next prime is 39996500123. The reversal of 39996500070 is 7000569993.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 39996499992 and 39996500019.
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 7 ways as a sum of consecutive naturals, for example, 666608305 + ... + 666608364.
It is an arithmetic number, because the mean of its divisors is an integer number (5999475015).
Almost surely, 239996500070 is an apocalyptic number.
39996500070 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
39996500070 is an abundant number, since it is smaller than the sum of its proper divisors (55995100170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
39996500070 is a wasteful number, since it uses less digits than its factorization.
39996500070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333216679.
The product of its (nonzero) digits is 459270, while the sum is 48.
The spelling of 39996500070 in words is "thirty-nine billion, nine hundred ninety-six million, five hundred thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •