Base | Representation |
---|---|
bin | 100000110010101010… |
… | …0110111001011100001 |
3 | 20201202122121102111012 |
4 | 1001211110313023201 |
5 | 2123204334210244 |
6 | 52203353030305 |
7 | 5042026254524 |
oct | 1014524671341 |
9 | 221678542435 |
10 | 70419444449 |
11 | 27956a38982 |
12 | 117933b5395 |
13 | 6843306533 |
14 | 35a05dcbbb |
15 | 1c7236589e |
hex | 10655372e1 |
70419444449 has 2 divisors, whose sum is σ = 70419444450. Its totient is φ = 70419444448.
The previous prime is 70419444409. The next prime is 70419444451. The reversal of 70419444449 is 94444491407.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70063443025 + 356001424 = 264695^2 + 18868^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-70419444449 is a prime.
It is a Sophie Germain prime.
Together with 70419444451, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 70419444397 and 70419444406.
It is not a weakly prime, because it can be changed into another prime (70419444409) 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 as a sum of consecutive naturals, namely, 35209722224 + 35209722225.
It is an arithmetic number, because the mean of its divisors is an integer number (35209722225).
Almost surely, 270419444449 is an apocalyptic number.
It is an amenable number.
70419444449 is a deficient number, since it is larger than the sum of its proper divisors (1).
70419444449 is an equidigital number, since it uses as much as digits as its factorization.
70419444449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2322432, while the sum is 50.
The spelling of 70419444449 in words is "seventy billion, four hundred nineteen million, four hundred forty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •