Base | Representation |
---|---|
bin | 1100110010011101001100111… |
… | …1101011011100111101001001 |
3 | 11101000021210220102110202002011 |
4 | 3030213103033223130331021 |
5 | 1420422444212233022414 |
6 | 12505533211412335521 |
7 | 360356534502545065 |
oct | 31447231753347511 |
9 | 4330253812422064 |
10 | 899902212001609 |
11 | 2408114262aa973 |
12 | 84b1b0b20145a1 |
13 | 2c8195507762ab |
14 | 11c316dc726aa5 |
15 | 6e087c5acedc4 |
hex | 33274cfadcf49 |
899902212001609 has 2 divisors, whose sum is σ = 899902212001610. Its totient is φ = 899902212001608.
The previous prime is 899902212001607. The next prime is 899902212001621. The reversal of 899902212001609 is 906100212209998.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 890043867961609 + 9858344040000 = 29833603^2 + 3139800^2 .
It is a cyclic number.
It is not a de Polignac number, because 899902212001609 - 21 = 899902212001607 is a prime.
Together with 899902212001607, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (899902212001601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 449951106000804 + 449951106000805.
It is an arithmetic number, because the mean of its divisors is an integer number (449951106000805).
Almost surely, 2899902212001609 is an apocalyptic number.
It is an amenable number.
899902212001609 is a deficient number, since it is larger than the sum of its proper divisors (1).
899902212001609 is an equidigital number, since it uses as much as digits as its factorization.
899902212001609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2519424, while the sum is 58.
The spelling of 899902212001609 in words is "eight hundred ninety-nine trillion, nine hundred two billion, two hundred twelve million, one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •