Base | Representation |
---|---|
bin | 101111000011100111… |
… | …1100110101100000001 |
3 | 100122211120112121220101 |
4 | 1132013033212230001 |
5 | 3123424113400333 |
6 | 114231230042401 |
7 | 10205123362633 |
oct | 1360717465401 |
9 | 318746477811 |
10 | 101053262593 |
11 | 39946a28958 |
12 | 17702649401 |
13 | 96b5aa804a |
14 | 4c68cb4a53 |
15 | 296693c67d |
hex | 17873e6b01 |
101053262593 has 2 divisors, whose sum is σ = 101053262594. Its totient is φ = 101053262592.
The previous prime is 101053262591. The next prime is 101053262663. The reversal of 101053262593 is 395262350101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100015327504 + 1037935089 = 316252^2 + 32217^2 .
It is an emirp because it is prime and its reverse (395262350101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101053262593 - 21 = 101053262591 is a prime.
Together with 101053262591, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (101053262591) 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, 50526631296 + 50526631297.
It is an arithmetic number, because the mean of its divisors is an integer number (50526631297).
Almost surely, 2101053262593 is an apocalyptic number.
It is an amenable number.
101053262593 is a deficient number, since it is larger than the sum of its proper divisors (1).
101053262593 is an equidigital number, since it uses as much as digits as its factorization.
101053262593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 101053262593 in words is "one hundred one billion, fifty-three million, two hundred sixty-two thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •