Base | Representation |
---|---|
bin | 100000101100000011… |
… | …1111000111101000101 |
3 | 20201012012210211120002 |
4 | 1001120013320331011 |
5 | 2122231133040122 |
6 | 52125401251045 |
7 | 5033366434211 |
oct | 1013007707505 |
9 | 221165724502 |
10 | 70197940037 |
11 | 278529a8385 |
12 | 11731193a85 |
13 | 6809460134 |
14 | 357d01d941 |
15 | 1c5cbae992 |
hex | 10581f8f45 |
70197940037 has 8 divisors (see below), whose sum is σ = 74267661600. Its totient is φ = 66165727824.
The previous prime is 70197940031. The next prime is 70197940061. The reversal of 70197940037 is 73004979107.
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 70197940037 - 210 = 70197939013 is a prime.
It is a super-2 number, since 2×701979400372 (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 = 70197939973 and 70197940000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70197940031) 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, 9373487 + ... + 9380972.
It is an arithmetic number, because the mean of its divisors is an integer number (9283457700).
Almost surely, 270197940037 is an apocalyptic number.
It is an amenable number.
70197940037 is a deficient number, since it is larger than the sum of its proper divisors (4069721563).
70197940037 is a wasteful number, since it uses less digits than its factorization.
70197940037 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18754675.
The product of its (nonzero) digits is 333396, while the sum is 47.
The spelling of 70197940037 in words is "seventy billion, one hundred ninety-seven million, nine hundred forty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •