Base | Representation |
---|---|
bin | 1100110010100010100000011… |
… | …0001101100010101110011101 |
3 | 11101000121112001222112122011221 |
4 | 3030220220012031202232131 |
5 | 1420430442310213033041 |
6 | 12510043120215213341 |
7 | 360366241331253346 |
oct | 31450500615425635 |
9 | 4330545058478157 |
10 | 899993321221021 |
11 | 24084702a062a15 |
12 | 84b3489a377251 |
13 | 2c825010326701 |
14 | 11c35ca2a830cd |
15 | 6e0ad595142d1 |
hex | 3328a06362b9d |
899993321221021 has 2 divisors, whose sum is σ = 899993321221022. Its totient is φ = 899993321221020.
The previous prime is 899993321221003. The next prime is 899993321221121. The reversal of 899993321221021 is 120122123399998.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 690218246720025 + 209775074500996 = 26272005^2 + 14483614^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-899993321221021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (899993321221121) 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, 449996660610510 + 449996660610511.
It is an arithmetic number, because the mean of its divisors is an integer number (449996660610511).
Almost surely, 2899993321221021 is an apocalyptic number.
It is an amenable number.
899993321221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
899993321221021 is an equidigital number, since it uses as much as digits as its factorization.
899993321221021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7558272, while the sum is 61.
The spelling of 899993321221021 in words is "eight hundred ninety-nine trillion, nine hundred ninety-three billion, three hundred twenty-one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •