Base | Representation |
---|---|
bin | 101111000011001110… |
… | …1110100100010100011 |
3 | 100122210122222121000221 |
4 | 1132012131310202203 |
5 | 3123412243242011 |
6 | 114230042223511 |
7 | 10204604426635 |
oct | 1360635644243 |
9 | 318718877027 |
10 | 101040212131 |
11 | 3993a624951 |
12 | 176ba1b4b97 |
13 | 96b3188b91 |
14 | 4c67278a55 |
15 | 2965710971 |
hex | 17867748a3 |
101040212131 has 2 divisors, whose sum is σ = 101040212132. Its totient is φ = 101040212130.
The previous prime is 101040212101. The next prime is 101040212153. The reversal of 101040212131 is 131212040101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101040212131 - 211 = 101040210083 is a prime.
It is a super-2 number, since 2×1010402121312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101040212101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50520106065 + 50520106066.
It is an arithmetic number, because the mean of its divisors is an integer number (50520106066).
Almost surely, 2101040212131 is an apocalyptic number.
101040212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101040212131 is an equidigital number, since it uses as much as digits as its factorization.
101040212131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 101040212131 its reverse (131212040101), we get a palindrome (232252252232).
The spelling of 101040212131 in words is "one hundred one billion, forty million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •