Base | Representation |
---|---|
bin | 100001000011111100… |
… | …1010011010101011101 |
3 | 20210021001221100112101 |
4 | 1002013321103111131 |
5 | 2130401323003201 |
6 | 52341112005101 |
7 | 5062301063203 |
oct | 1020771232535 |
9 | 223231840471 |
10 | 70999422301 |
11 | 28124360915 |
12 | 11915690791 |
13 | 69065118b2 |
14 | 3617653073 |
15 | 1ca822ad01 |
hex | 1087e5355d |
70999422301 has 4 divisors (see below), whose sum is σ = 72202802400. Its totient is φ = 69796042204.
The previous prime is 70999422293. The next prime is 70999422331. The reversal of 70999422301 is 10322499907.
It is a happy number.
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 not a de Polignac number, because 70999422301 - 23 = 70999422293 is a prime.
It is a super-2 number, since 2×709994223012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70999422331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 601689961 + ... + 601690078.
It is an arithmetic number, because the mean of its divisors is an integer number (18050700600).
Almost surely, 270999422301 is an apocalyptic number.
It is an amenable number.
70999422301 is a deficient number, since it is larger than the sum of its proper divisors (1203380099).
70999422301 is a wasteful number, since it uses less digits than its factorization.
70999422301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203380098.
The product of its (nonzero) digits is 244944, while the sum is 46.
The spelling of 70999422301 in words is "seventy billion, nine hundred ninety-nine million, four hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •