Base | Representation |
---|---|
bin | 10110111111011111011100… |
… | …001111100010110011110111 |
3 | 111021000222200100002211112002 |
4 | 112333133130033202303313 |
5 | 101223222441142040431 |
6 | 555021534241445515 |
7 | 30204454411043015 |
oct | 2677373417426367 |
9 | 437028610084462 |
10 | 101120110111991 |
11 | 2a246885a64a33 |
12 | b41190834089b |
13 | 445677c370169 |
14 | 1ad834d0658b5 |
15 | ba55759dc3cb |
hex | 5bf7dc3e2cf7 |
101120110111991 has 2 divisors, whose sum is σ = 101120110111992. Its totient is φ = 101120110111990.
The previous prime is 101120110111949. The next prime is 101120110112071. The reversal of 101120110111991 is 199111011021101.
It is a weak prime.
It is an emirp because it is prime and its reverse (199111011021101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101120110111991 - 230 = 101119036370167 is a prime.
It is a super-2 number, since 2×1011201101119912 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101120110117991) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50560055055995 + 50560055055996.
It is an arithmetic number, because the mean of its divisors is an integer number (50560055055996).
Almost surely, 2101120110111991 is an apocalyptic number.
101120110111991 is a deficient number, since it is larger than the sum of its proper divisors (1).
101120110111991 is an equidigital number, since it uses as much as digits as its factorization.
101120110111991 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 29.
It can be divided in two parts, 101120110 and 111991, that added together give a palindrome (101232101).
The spelling of 101120110111991 in words is "one hundred one trillion, one hundred twenty billion, one hundred ten million, one hundred eleven thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •