Base | Representation |
---|---|
bin | 10110111111010111000011… |
… | …110011001110001111001001 |
3 | 111021000010110002222211221102 |
4 | 112333113003303032033021 |
5 | 101223101023141144123 |
6 | 555013445220151145 |
7 | 30204015365151524 |
oct | 2677270363161711 |
9 | 437003402884842 |
10 | 101111110099913 |
11 | 2a242a87765721 |
12 | b4100162384b5 |
13 | 44559768b7524 |
14 | 1ad7b37a49bbb |
15 | ba51ea80c028 |
hex | 5bf5c3cce3c9 |
101111110099913 has 2 divisors, whose sum is σ = 101111110099914. Its totient is φ = 101111110099912.
The previous prime is 101111110099871. The next prime is 101111110099969. The reversal of 101111110099913 is 319990011111101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65830456278409 + 35280653821504 = 8113597^2 + 5939752^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101111110099913 is a prime.
It is a super-3 number, since 3×1011111100999133 (a number of 43 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (101111110099513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555555049956 + 50555555049957.
It is an arithmetic number, because the mean of its divisors is an integer number (50555555049957).
Almost surely, 2101111110099913 is an apocalyptic number.
It is an amenable number.
101111110099913 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111110099913 is an equidigital number, since it uses as much as digits as its factorization.
101111110099913 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2187, while the sum is 38.
The spelling of 101111110099913 in words is "one hundred one trillion, one hundred eleven billion, one hundred ten million, ninety-nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •