Base | Representation |
---|---|
bin | 10110111101111010110111… |
… | …000011110101001011001011 |
3 | 111020122122220202210111021111 |
4 | 112331322313003311023023 |
5 | 101214440301144231331 |
6 | 554500153525351151 |
7 | 30163612206103261 |
oct | 2675726703651313 |
9 | 436578822714244 |
10 | 101012112102091 |
11 | 2a204aa59a06a3 |
12 | b3b49a7b684b7 |
13 | 444952a8663a8 |
14 | 1ad3025ad8431 |
15 | ba285454bdb1 |
hex | 5bdeb70f52cb |
101012112102091 has 2 divisors, whose sum is σ = 101012112102092. Its totient is φ = 101012112102090.
The previous prime is 101012112102067. The next prime is 101012112102157. The reversal of 101012112102091 is 190201211210101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101012112102091 is a prime.
It is a super-3 number, since 3×1010121121020913 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101012112102061) 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, 50506056051045 + 50506056051046.
It is an arithmetic number, because the mean of its divisors is an integer number (50506056051046).
Almost surely, 2101012112102091 is an apocalyptic number.
101012112102091 is a deficient number, since it is larger than the sum of its proper divisors (1).
101012112102091 is an equidigital number, since it uses as much as digits as its factorization.
101012112102091 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 101012112102091 its reverse (190201211210101), we get a palindrome (291213323312192).
The spelling of 101012112102091 in words is "one hundred one trillion, twelve billion, one hundred twelve million, one hundred two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •