Base | Representation |
---|---|
bin | 101111010110101100… |
… | …0100001100011111101 |
3 | 100201111011120111222011 |
4 | 1132231120201203331 |
5 | 3131231420310401 |
6 | 114414524451221 |
7 | 10230023246305 |
oct | 1365530414375 |
9 | 321434514864 |
10 | 101693135101 |
11 | 3a14513a608 |
12 | 178609a9b11 |
13 | 978852442c |
14 | 4cc9c7a605 |
15 | 29a2bd4451 |
hex | 17ad6218fd |
101693135101 has 2 divisors, whose sum is σ = 101693135102. Its totient is φ = 101693135100.
The previous prime is 101693135087. The next prime is 101693135113. The reversal of 101693135101 is 101531396101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 74722956025 + 26970179076 = 273355^2 + 164226^2 .
It is a cyclic number.
It is not a de Polignac number, because 101693135101 - 211 = 101693133053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101693135161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50846567550 + 50846567551.
It is an arithmetic number, because the mean of its divisors is an integer number (50846567551).
Almost surely, 2101693135101 is an apocalyptic number.
It is an amenable number.
101693135101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101693135101 is an equidigital number, since it uses as much as digits as its factorization.
101693135101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 31.
The spelling of 101693135101 in words is "one hundred one billion, six hundred ninety-three million, one hundred thirty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •