Base | Representation |
---|---|
bin | 1100111011101000011001010… |
… | …0101010101001001001001101 |
3 | 11102100000012111200200121001022 |
4 | 3032322012110222221021031 |
5 | 1423233234211112040244 |
6 | 12543215403020523525 |
7 | 362450420664642263 |
oct | 31672062452511115 |
9 | 4370005450617038 |
10 | 909990100111949 |
11 | 243a506a813601a |
12 | 8608a2173b05a5 |
13 | 3009b91003221c |
14 | 1209da82090433 |
15 | 7030de67896ee |
hex | 33ba194aa924d |
909990100111949 has 2 divisors, whose sum is σ = 909990100111950. Its totient is φ = 909990100111948.
The previous prime is 909990100111931. The next prime is 909990100112033. The reversal of 909990100111949 is 949111001099909.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 900274940994724 + 9715159117225 = 30004582^2 + 3116915^2 .
It is a cyclic number.
It is not a de Polignac number, because 909990100111949 - 216 = 909990100046413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 909990100111891 and 909990100111900.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (909990100111249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 454995050055974 + 454995050055975.
It is an arithmetic number, because the mean of its divisors is an integer number (454995050055975).
Almost surely, 2909990100111949 is an apocalyptic number.
It is an amenable number.
909990100111949 is a deficient number, since it is larger than the sum of its proper divisors (1).
909990100111949 is an equidigital number, since it uses as much as digits as its factorization.
909990100111949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2125764, while the sum is 62.
The spelling of 909990100111949 in words is "nine hundred nine trillion, nine hundred ninety billion, one hundred million, one hundred eleven thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •