Base | Representation |
---|---|
bin | 100000101001011101… |
… | …1001011010001101100 |
3 | 20200222010200122201021 |
4 | 1001102323023101230 |
5 | 2122041321034012 |
6 | 52113004023524 |
7 | 5031260203534 |
oct | 1012273132154 |
9 | 220863618637 |
10 | 70110721132 |
11 | 27808746541 |
12 | 11707b31ba4 |
13 | 67c437300a |
14 | 35715d84c4 |
15 | 1c551d2007 |
hex | 1052ecb46c |
70110721132 has 12 divisors (see below), whose sum is σ = 123402975696. Its totient is φ = 34852728080.
The previous prime is 70110721127. The next prime is 70110721133. The reversal of 70110721132 is 23112701107.
It is a super-2 number, since 2×701107211322 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 70110721097 and 70110721106.
It is not an unprimeable number, because it can be changed into a prime (70110721133) 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 3 ways as a sum of consecutive naturals, for example, 50657344 + ... + 50658727.
It is an arithmetic number, because the mean of its divisors is an integer number (10283581308).
Almost surely, 270110721132 is an apocalyptic number.
It is an amenable number.
70110721132 is a deficient number, since it is larger than the sum of its proper divisors (53292254564).
70110721132 is a wasteful number, since it uses less digits than its factorization.
70110721132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101316248 (or 101316246 counting only the distinct ones).
The product of its (nonzero) digits is 588, while the sum is 25.
The spelling of 70110721132 in words is "seventy billion, one hundred ten million, seven hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •