Base | Representation |
---|---|
bin | 10111000010010001110010… |
… | …110010100000110010001111 |
3 | 111021201021222121020202111112 |
4 | 113002101302302200302033 |
5 | 101234342141243002114 |
6 | 555245525123442235 |
7 | 30224344151604011 |
oct | 2702216262406217 |
9 | 437637877222445 |
10 | 101311614422159 |
11 | 2a310018175669 |
12 | b442a5282637b |
13 | 446b84b542c1b |
14 | 1b03718aca1b1 |
15 | baa5331a013e |
hex | 5c2472ca0c8f |
101311614422159 has 2 divisors, whose sum is σ = 101311614422160. Its totient is φ = 101311614422158.
The previous prime is 101311614422093. The next prime is 101311614422167. The reversal of 101311614422159 is 951224416113101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101311614422159 - 28 = 101311614421903 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101311614452159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50655807211079 + 50655807211080.
It is an arithmetic number, because the mean of its divisors is an integer number (50655807211080).
Almost surely, 2101311614422159 is an apocalyptic number.
101311614422159 is a deficient number, since it is larger than the sum of its proper divisors (1).
101311614422159 is an equidigital number, since it uses as much as digits as its factorization.
101311614422159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 41.
The spelling of 101311614422159 in words is "one hundred one trillion, three hundred eleven billion, six hundred fourteen million, four hundred twenty-two thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •