Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …110001010101011111010111 |
3 | 111010210222120201222012202111 |
4 | 112302033312301111133113 |
5 | 101113320111130024231 |
6 | 553043503145251451 |
7 | 30051635523502306 |
oct | 2662176661253727 |
9 | 433728521865674 |
10 | 100210022111191 |
11 | 29a259170148a3 |
12 | b2a5459793b87 |
13 | 43bb9c28c4915 |
14 | 1aa6295d7043d |
15 | b8ba5ca1d4b1 |
hex | 5b23f6c557d7 |
100210022111191 has 2 divisors, whose sum is σ = 100210022111192. Its totient is φ = 100210022111190.
The previous prime is 100210022111123. The next prime is 100210022111267. The reversal of 100210022111191 is 191111220012001.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 100210022111191 - 237 = 100072583157719 is a prime.
It is a super-4 number, since 4×1002100221111914 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100210022115191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105011055595 + 50105011055596.
It is an arithmetic number, because the mean of its divisors is an integer number (50105011055596).
Almost surely, 2100210022111191 is an apocalyptic number.
100210022111191 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210022111191 is an equidigital number, since it uses as much as digits as its factorization.
100210022111191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
Adding to 100210022111191 its reverse (191111220012001), we get a palindrome (291321242123192).
The spelling of 100210022111191 in words is "one hundred trillion, two hundred ten billion, twenty-two million, one hundred eleven thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •