Base | Representation |
---|---|
bin | 101111000101000111… |
… | …0001101110010100001 |
3 | 100122222001120020110021 |
4 | 1132022032031302201 |
5 | 3124024411330423 |
6 | 114240213033441 |
7 | 10206301163554 |
oct | 1361216156241 |
9 | 318861506407 |
10 | 101103230113 |
11 | 39972157226 |
12 | 17717325881 |
13 | 96c3251722 |
14 | 4c717a069b |
15 | 296b00c95d |
hex | 178a38dca1 |
101103230113 has 2 divisors, whose sum is σ = 101103230114. Its totient is φ = 101103230112.
The previous prime is 101103230101. The next prime is 101103230131. The reversal of 101103230113 is 311032301101.
Together with next prime (101103230131) 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., 74236086369 + 26867143744 = 272463^2 + 163912^2 .
It is a cyclic number.
It is not a de Polignac number, because 101103230113 - 233 = 92513295521 is a prime.
It is a super-3 number, since 3×1011032301133 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101103230153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551615056 + 50551615057.
It is an arithmetic number, because the mean of its divisors is an integer number (50551615057).
Almost surely, 2101103230113 is an apocalyptic number.
It is an amenable number.
101103230113 is a deficient number, since it is larger than the sum of its proper divisors (1).
101103230113 is an equidigital number, since it uses as much as digits as its factorization.
101103230113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 101103230113 its reverse (311032301101), we get a palindrome (412135531214).
The spelling of 101103230113 in words is "one hundred one billion, one hundred three million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •