Base | Representation |
---|---|
bin | 10110111111001110110001… |
… | …011000101100001000010111 |
3 | 111020222021110221011220121011 |
4 | 112333032301120230020113 |
5 | 101222424312033014431 |
6 | 555005414210233051 |
7 | 30203252021006302 |
oct | 2677166130541027 |
9 | 436867427156534 |
10 | 101102211219991 |
11 | 2a23a230560503 |
12 | b40a351b85787 |
13 | 4454b890807c7 |
14 | 1ad7531c37b39 |
15 | ba4d79456cb1 |
hex | 5bf3b162c217 |
101102211219991 has 2 divisors, whose sum is σ = 101102211219992. Its totient is φ = 101102211219990.
The previous prime is 101102211219923. The next prime is 101102211220027. The reversal of 101102211219991 is 199912112201101.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (199912112201101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101102211219991 - 217 = 101102211088919 is a prime.
It is a super-2 number, since 2×1011022112199912 (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 (101102211219791) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50551105609995 + 50551105609996.
It is an arithmetic number, because the mean of its divisors is an integer number (50551105609996).
Almost surely, 2101102211219991 is an apocalyptic number.
101102211219991 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102211219991 is an equidigital number, since it uses as much as digits as its factorization.
101102211219991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 40.
The spelling of 101102211219991 in words is "one hundred one trillion, one hundred two billion, two hundred eleven million, two hundred nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •