Base | Representation |
---|---|
bin | 10000000100111110110010… |
… | …000101010110011011101101 |
3 | 100021100220112120011202220120 |
4 | 100010332302011112123231 |
5 | 33232012144242403401 |
6 | 410220111205035153 |
7 | 20615463230561160 |
oct | 2004766205263355 |
9 | 307326476152816 |
10 | 70711034341101 |
11 | 205924214a8590 |
12 | 7b203323b5ab9 |
13 | 305c03923315b |
14 | 136660a419ad7 |
15 | 829552672836 |
hex | 404fb21566ed |
70711034341101 has 16 divisors (see below), whose sum is σ = 117545615528448. Its totient is φ = 36733004852400.
The previous prime is 70711034341069. The next prime is 70711034341109. The reversal of 70711034341101 is 10114343011707.
It is not a de Polignac number, because 70711034341101 - 25 = 70711034341069 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70711034341109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 153054186655 + ... + 153054187116.
It is an arithmetic number, because the mean of its divisors is an integer number (7346600970528).
Almost surely, 270711034341101 is an apocalyptic number.
It is an amenable number.
70711034341101 is a deficient number, since it is larger than the sum of its proper divisors (46834581187347).
70711034341101 is a wasteful number, since it uses less digits than its factorization.
70711034341101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306108373792.
The product of its (nonzero) digits is 7056, while the sum is 33.
Adding to 70711034341101 its reverse (10114343011707), we get a palindrome (80825377352808).
The spelling of 70711034341101 in words is "seventy trillion, seven hundred eleven billion, thirty-four million, three hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •