Base | Representation |
---|---|
bin | 100000101010110110… |
… | …0000000001010100011 |
3 | 20201002100220200102011 |
4 | 1001111230000022203 |
5 | 2122140202400412 |
6 | 52121341333351 |
7 | 5032362204400 |
oct | 1012554001243 |
9 | 221070820364 |
10 | 70157075107 |
11 | 27831926a09 |
12 | 1171b567257 |
13 | 6800b529c2 |
14 | 35778232a7 |
15 | 1c592db7a7 |
hex | 1055b002a3 |
70157075107 has 24 divisors (see below), whose sum is σ = 86962512384. Its totient is φ = 56236707072.
The previous prime is 70157075089. The next prime is 70157075213.
70157075107 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 70157075107 - 27 = 70157074979 is a prime.
It is a super-2 number, since 2×701570751072 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 70157075107.
It is not an unprimeable number, because it can be changed into a prime (70157075507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 137443 + ... + 399004.
It is an arithmetic number, because the mean of its divisors is an integer number (3623438016).
Almost surely, 270157075107 is an apocalyptic number.
70157075107 is a deficient number, since it is larger than the sum of its proper divisors (16805437277).
70157075107 is a wasteful number, since it uses less digits than its factorization.
70157075107 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536635 (or 536628 counting only the distinct ones).
The product of its (nonzero) digits is 60025, while the sum is 40.
It can be divided in two parts, 701570 and 75107, that added together give a palindrome (776677).
The spelling of 70157075107 in words is "seventy billion, one hundred fifty-seven million, seventy-five thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •