Base | Representation |
---|---|
bin | 100000110010011100… |
… | …1100011010110111001 |
3 | 20201202011010201002002 |
4 | 1001210321203112321 |
5 | 2123201021112434 |
6 | 52202535350345 |
7 | 5041611356546 |
oct | 1014471432671 |
9 | 221664121062 |
10 | 70412285369 |
11 | 27952999188 |
12 | 11790b223b5 |
13 | 684199aaaa |
14 | 359d697bcd |
15 | 1c718ee57e |
hex | 1064e635b9 |
70412285369 has 2 divisors, whose sum is σ = 70412285370. Its totient is φ = 70412285368.
The previous prime is 70412285347. The next prime is 70412285371. The reversal of 70412285369 is 96358221407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62818905769 + 7593379600 = 250637^2 + 87140^2 .
It is a cyclic number.
It is not a de Polignac number, because 70412285369 - 220 = 70411236793 is a prime.
It is a super-2 number, since 2×704122853692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 70412285371, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (70412288369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35206142684 + 35206142685.
It is an arithmetic number, because the mean of its divisors is an integer number (35206142685).
It is a 1-persistent number, because it is pandigital, but 2⋅70412285369 = 140824570738 is not.
Almost surely, 270412285369 is an apocalyptic number.
It is an amenable number.
70412285369 is a deficient number, since it is larger than the sum of its proper divisors (1).
70412285369 is an equidigital number, since it uses as much as digits as its factorization.
70412285369 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 70412285369 in words is "seventy billion, four hundred twelve million, two hundred eighty-five thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •