Base | Representation |
---|---|
bin | 101111000101111110… |
… | …1100100110010111011 |
3 | 100200001002111100122112 |
4 | 1132023331210302323 |
5 | 3124104400003311 |
6 | 114243134442535 |
7 | 10210104256223 |
oct | 1361375446273 |
9 | 320032440575 |
10 | 101132422331 |
11 | 39987685826 |
12 | 1772506344b |
13 | 96c9302b25 |
14 | 4c755dd083 |
15 | 296d87728b |
hex | 178bf64cbb |
101132422331 has 2 divisors, whose sum is σ = 101132422332. Its totient is φ = 101132422330.
The previous prime is 101132422253. The next prime is 101132422337. The reversal of 101132422331 is 133224231101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101132422331 - 230 = 100058680507 is a prime.
It is a super-3 number, since 3×1011324223313 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 101132422297 and 101132422306.
It is not a weakly prime, because it can be changed into another prime (101132422337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50566211165 + 50566211166.
It is an arithmetic number, because the mean of its divisors is an integer number (50566211166).
Almost surely, 2101132422331 is an apocalyptic number.
101132422331 is a deficient number, since it is larger than the sum of its proper divisors (1).
101132422331 is an equidigital number, since it uses as much as digits as its factorization.
101132422331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 101132422331 its reverse (133224231101), we get a palindrome (234356653432).
The spelling of 101132422331 in words is "one hundred one billion, one hundred thirty-two million, four hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •