Base | Representation |
---|---|
bin | 10111000001000110101101… |
… | …111111001100010001011011 |
3 | 111021102120220200001120001112 |
4 | 113001012231333030101123 |
5 | 101232032043311120011 |
6 | 555144514134010535 |
7 | 30215461425661025 |
oct | 2701065577142133 |
9 | 437376820046045 |
10 | 101231003223131 |
11 | 2a289911261721 |
12 | b42b2b61a6a4b |
13 | 44640728c0ca2 |
14 | 1add86cad1015 |
15 | ba83b620058b |
hex | 5c11adfcc45b |
101231003223131 has 2 divisors, whose sum is σ = 101231003223132. Its totient is φ = 101231003223130.
The previous prime is 101231003223073. The next prime is 101231003223137. The reversal of 101231003223131 is 131322300132101.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101231003223131 is a prime.
It is a super-2 number, since 2×1012310032231312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101231003223097 and 101231003223106.
It is not a weakly prime, because it can be changed into another prime (101231003223137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50615501611565 + 50615501611566.
It is an arithmetic number, because the mean of its divisors is an integer number (50615501611566).
Almost surely, 2101231003223131 is an apocalyptic number.
101231003223131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101231003223131 is an equidigital number, since it uses as much as digits as its factorization.
101231003223131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 101231003223131 its reverse (131322300132101), we get a palindrome (232553303355232).
The spelling of 101231003223131 in words is "one hundred one trillion, two hundred thirty-one billion, three million, two hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •