Base | Representation |
---|---|
bin | 11111111011111011110000… |
… | …01001100001101011001001 |
3 | 100012122211101120111001100022 |
4 | 33331331320021201223021 |
5 | 33201113021130120131 |
6 | 405210434045550225 |
7 | 20535610506466130 |
oct | 1775757011415311 |
9 | 305584346431308 |
10 | 70229026020041 |
11 | 20416a65359839 |
12 | 7a62a32875375 |
13 | 3025751691365 |
14 | 134b162898917 |
15 | 81bc4130237b |
hex | 3fdf78261ac9 |
70229026020041 has 4 divisors (see below), whose sum is σ = 80261744022912. Its totient is φ = 60196308017172.
The previous prime is 70229026020007. The next prime is 70229026020059. The reversal of 70229026020041 is 14002062092207.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-70229026020041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 70229026019983 and 70229026020010.
It is not an unprimeable number, because it can be changed into a prime (70229026020841) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5016359001425 + ... + 5016359001438.
It is an arithmetic number, because the mean of its divisors is an integer number (20065436005728).
Almost surely, 270229026020041 is an apocalyptic number.
It is an amenable number.
70229026020041 is a deficient number, since it is larger than the sum of its proper divisors (10032718002871).
70229026020041 is a wasteful number, since it uses less digits than its factorization.
70229026020041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10032718002870.
The product of its (nonzero) digits is 24192, while the sum is 35.
The spelling of 70229026020041 in words is "seventy trillion, two hundred twenty-nine billion, twenty-six million, twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •