Base | Representation |
---|---|
bin | 1111001010010100110111… |
… | …0010101101011000011001 |
3 | 2012000122101001201222111011 |
4 | 3302211031302231120121 |
5 | 4141110302220330424 |
6 | 55242043110333521 |
7 | 3340241645245462 |
oct | 362451562553031 |
9 | 65018331658434 |
10 | 16670073214489 |
11 | 5347813818182 |
12 | 1a5293195a2a1 |
13 | 93bc9a7b5b36 |
14 | 418b9b7d5d69 |
15 | 1dd9609bc694 |
hex | f294dcad619 |
16670073214489 has 2 divisors, whose sum is σ = 16670073214490. Its totient is φ = 16670073214488.
The previous prime is 16670073214441. The next prime is 16670073214511. The reversal of 16670073214489 is 98441237007661.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15667505568400 + 1002567646089 = 3958220^2 + 1001283^2 .
It is a cyclic number.
It is not a de Polignac number, because 16670073214489 - 29 = 16670073213977 is a prime.
It is a super-2 number, since 2×166700732144892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (16670073214429) 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 as a sum of consecutive naturals, namely, 8335036607244 + 8335036607245.
It is an arithmetic number, because the mean of its divisors is an integer number (8335036607245).
Almost surely, 216670073214489 is an apocalyptic number.
It is an amenable number.
16670073214489 is a deficient number, since it is larger than the sum of its proper divisors (1).
16670073214489 is an equidigital number, since it uses as much as digits as its factorization.
16670073214489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12192768, while the sum is 58.
The spelling of 16670073214489 in words is "sixteen trillion, six hundred seventy billion, seventy-three million, two hundred fourteen thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •