Base | Representation |
---|---|
bin | 10110111111101001110010… |
… | …100111111011110101010011 |
3 | 111021002001100211000012110011 |
4 | 112333221302213323311103 |
5 | 101223413221043213211 |
6 | 555031013102015351 |
7 | 30205326661163203 |
oct | 2677516247736523 |
9 | 437061324005404 |
10 | 101131223022931 |
11 | 2a250568a02452 |
12 | b413aa9b77557 |
13 | 44578307abaca |
14 | 1ad8ac4d28403 |
15 | ba59c6431921 |
hex | 5bfa729fbd53 |
101131223022931 has 2 divisors, whose sum is σ = 101131223022932. Its totient is φ = 101131223022930.
The previous prime is 101131223022923. The next prime is 101131223023067. The reversal of 101131223022931 is 139220322131101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101131223022931 - 23 = 101131223022923 is a prime.
It is a super-2 number, since 2×1011312230229312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101131223022893 and 101131223022902.
It is not a weakly prime, because it can be changed into another prime (101131223022031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565611511465 + 50565611511466.
It is an arithmetic number, because the mean of its divisors is an integer number (50565611511466).
Almost surely, 2101131223022931 is an apocalyptic number.
101131223022931 is a deficient number, since it is larger than the sum of its proper divisors (1).
101131223022931 is an equidigital number, since it uses as much as digits as its factorization.
101131223022931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 101131223022931 in words is "one hundred one trillion, one hundred thirty-one billion, two hundred twenty-three million, twenty-two thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •