Base | Representation |
---|---|
bin | 101111001010100101… |
… | …0110111100100010001 |
3 | 100200102212011201221222 |
4 | 1132111022313210101 |
5 | 3124413421331113 |
6 | 114310333454425 |
7 | 10213661314322 |
oct | 1362512674421 |
9 | 320385151858 |
10 | 101286902033 |
11 | 39a568a76a9 |
12 | 17768941415 |
13 | 972230ca35 |
14 | 4c8bd32449 |
15 | 297c1dde08 |
hex | 17952b7911 |
101286902033 has 2 divisors, whose sum is σ = 101286902034. Its totient is φ = 101286902032.
The previous prime is 101286901999. The next prime is 101286902053. The reversal of 101286902033 is 330209682101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73306645504 + 27980256529 = 270752^2 + 167273^2 .
It is a cyclic number.
It is not a de Polignac number, because 101286902033 - 224 = 101270124817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101286901984 and 101286902002.
It is not a weakly prime, because it can be changed into another prime (101286902053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50643451016 + 50643451017.
It is an arithmetic number, because the mean of its divisors is an integer number (50643451017).
Almost surely, 2101286902033 is an apocalyptic number.
It is an amenable number.
101286902033 is a deficient number, since it is larger than the sum of its proper divisors (1).
101286902033 is an equidigital number, since it uses as much as digits as its factorization.
101286902033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 101286902033 in words is "one hundred one billion, two hundred eighty-six million, nine hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •