Base | Representation |
---|---|
bin | 101111001011100101… |
… | …0000000100011101111 |
3 | 100200112011220000220202 |
4 | 1132113022000203233 |
5 | 3130000434344101 |
6 | 114313524104115 |
7 | 10214544516626 |
oct | 1362712004357 |
9 | 320464800822 |
10 | 101320231151 |
11 | 39a736a1327 |
12 | 17777b3503b |
13 | 97291ac0c9 |
14 | 4c9252a6bd |
15 | 29800c436b |
hex | 17972808ef |
101320231151 has 2 divisors, whose sum is σ = 101320231152. Its totient is φ = 101320231150.
The previous prime is 101320231087. The next prime is 101320231171. The reversal of 101320231151 is 151132023101.
It is an a-pointer prime, because the next prime (101320231171) can be obtained adding 101320231151 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101320231151 - 26 = 101320231087 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101320231171) 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, 50660115575 + 50660115576.
It is an arithmetic number, because the mean of its divisors is an integer number (50660115576).
Almost surely, 2101320231151 is an apocalyptic number.
101320231151 is a deficient number, since it is larger than the sum of its proper divisors (1).
101320231151 is an equidigital number, since it uses as much as digits as its factorization.
101320231151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 101320231151 its reverse (151132023101), we get a palindrome (252452254252).
The spelling of 101320231151 in words is "one hundred one billion, three hundred twenty million, two hundred thirty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •