Base | Representation |
---|---|
bin | 10110111111001110110000… |
… | …101101011011100111010011 |
3 | 111020222021110010211210020221 |
4 | 112333032300231123213103 |
5 | 101222424301132131042 |
6 | 555005413123213511 |
7 | 30203251522426444 |
oct | 2677166055334723 |
9 | 436867403753227 |
10 | 101102199880147 |
11 | 2a23a225115734 |
12 | b40a34a217297 |
13 | 4454b8691013b |
14 | 1ad75305252cb |
15 | ba4d78466d67 |
hex | 5bf3b0b5b9d3 |
101102199880147 has 2 divisors, whose sum is σ = 101102199880148. Its totient is φ = 101102199880146.
The previous prime is 101102199880111. The next prime is 101102199880169. The reversal of 101102199880147 is 741088991201101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101102199880147 - 227 = 101102065662419 is a prime.
It is a super-2 number, since 2×1011021998801472 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101102199880094 and 101102199880103.
It is not a weakly prime, because it can be changed into another prime (101102199880177) 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, 50551099940073 + 50551099940074.
It is an arithmetic number, because the mean of its divisors is an integer number (50551099940074).
Almost surely, 2101102199880147 is an apocalyptic number.
101102199880147 is a deficient number, since it is larger than the sum of its proper divisors (1).
101102199880147 is an equidigital number, since it uses as much as digits as its factorization.
101102199880147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 290304, while the sum is 52.
The spelling of 101102199880147 in words is "one hundred one trillion, one hundred two billion, one hundred ninety-nine million, eight hundred eighty thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •