Base | Representation |
---|---|
bin | 101111001010101010… |
… | …0101110001000010001 |
3 | 100200110001000221212122 |
4 | 1132111110232020101 |
5 | 3124420102003232 |
6 | 114310505104025 |
7 | 10214022262313 |
oct | 1362524561021 |
9 | 320401027778 |
10 | 101289484817 |
11 | 39a58301134 |
12 | 17769788015 |
13 | 9722a05501 |
14 | 4c8c4057b3 |
15 | 297c54e312 |
hex | 179552e211 |
101289484817 has 2 divisors, whose sum is σ = 101289484818. Its totient is φ = 101289484816.
The previous prime is 101289484781. The next prime is 101289484819. The reversal of 101289484817 is 718484982101.
Together with previous prime (101289484781) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90288831361 + 11000653456 = 300481^2 + 104884^2 .
It is a cyclic number.
It is not a de Polignac number, because 101289484817 - 214 = 101289468433 is a prime.
Together with 101289484819, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (101289484819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50644742408 + 50644742409.
It is an arithmetic number, because the mean of its divisors is an integer number (50644742409).
Almost surely, 2101289484817 is an apocalyptic number.
It is an amenable number.
101289484817 is a deficient number, since it is larger than the sum of its proper divisors (1).
101289484817 is an equidigital number, since it uses as much as digits as its factorization.
101289484817 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1032192, while the sum is 53.
The spelling of 101289484817 in words is "one hundred one billion, two hundred eighty-nine million, four hundred eighty-four thousand, eight hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •