Base | Representation |
---|---|
bin | 101111000101111010… |
… | …1100100010010101001 |
3 | 100200000221112201001201 |
4 | 1132023311210102221 |
5 | 3124103330314423 |
6 | 114243021444201 |
7 | 10210050364111 |
oct | 1361365442251 |
9 | 320027481051 |
10 | 101130323113 |
11 | 39986481636 |
12 | 17724410661 |
13 | 96c8a494a1 |
14 | 4c75214041 |
15 | 296d5b02ad |
hex | 178bd644a9 |
101130323113 has 2 divisors, whose sum is σ = 101130323114. Its totient is φ = 101130323112.
The previous prime is 101130323101. The next prime is 101130323131. The reversal of 101130323113 is 311323031101.
Together with next prime (101130323131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78550151824 + 22580171289 = 280268^2 + 150267^2 .
It is a cyclic number.
It is not a de Polignac number, because 101130323113 - 213 = 101130314921 is a prime.
It is not a weakly prime, because it can be changed into another prime (101130323143) 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, 50565161556 + 50565161557.
It is an arithmetic number, because the mean of its divisors is an integer number (50565161557).
Almost surely, 2101130323113 is an apocalyptic number.
It is an amenable number.
101130323113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101130323113 is an equidigital number, since it uses as much as digits as its factorization.
101130323113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101130323113 its reverse (311323031101), we get a palindrome (412453354214).
The spelling of 101130323113 in words is "one hundred one billion, one hundred thirty million, three hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •