Base | Representation |
---|---|
bin | 100000100111010110… |
… | …1100011001001100101 |
3 | 20200210012200200110221 |
4 | 1001032231203021211 |
5 | 2121420222240122 |
6 | 52102001044341 |
7 | 5026441342312 |
oct | 1011655431145 |
9 | 220705620427 |
10 | 70040040037 |
11 | 2778185a810 |
12 | 116a83266b1 |
13 | 67b2826496 |
14 | 3566079d09 |
15 | 1c4ddbe6c7 |
hex | 104eb63265 |
70040040037 has 8 divisors (see below), whose sum is σ = 76411955520. Its totient is φ = 63668897760.
The previous prime is 70040040029. The next prime is 70040040073. The reversal of 70040040037 is 73004004007.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 70040040037 - 23 = 70040040029 is a prime.
It is a super-2 number, since 2×700400400372 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 70040039993 and 70040040020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70040041037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4953 + ... + 374305.
It is an arithmetic number, because the mean of its divisors is an integer number (9551494440).
Almost surely, 270040040037 is an apocalyptic number.
It is an amenable number.
70040040037 is a deficient number, since it is larger than the sum of its proper divisors (6371915483).
70040040037 is a wasteful number, since it uses less digits than its factorization.
70040040037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386603.
The product of its (nonzero) digits is 2352, while the sum is 25.
The spelling of 70040040037 in words is "seventy billion, forty million, forty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •