Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0101010001101010011101 |
3 | 1022202122110010121202000101 |
4 | 2102333102211101222131 |
5 | 2310443322240144213 |
6 | 33252200313101101 |
7 | 2061526136464432 |
oct | 222772245215235 |
9 | 38678403552011 |
10 | 10101001099933 |
11 | 32448a0874337 |
12 | 11717849b7791 |
13 | 58369c19b993 |
14 | 26cc69105b89 |
15 | 127b3bec9bdd |
hex | 92fd2951a9d |
10101001099933 has 2 divisors, whose sum is σ = 10101001099934. Its totient is φ = 10101001099932.
The previous prime is 10101001099927. The next prime is 10101001099993. The reversal of 10101001099933 is 33999010010101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5558079723364 + 4542921376569 = 2357558^2 + 2131413^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101001099933 - 233 = 10092411165341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10101001099892 and 10101001099901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10101001099993) 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, 5050500549966 + 5050500549967.
It is an arithmetic number, because the mean of its divisors is an integer number (5050500549967).
Almost surely, 210101001099933 is an apocalyptic number.
It is an amenable number.
10101001099933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101001099933 is an equidigital number, since it uses as much as digits as its factorization.
10101001099933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 37.
The spelling of 10101001099933 in words is "ten trillion, one hundred one billion, one million, ninety-nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •