Base | Representation |
---|---|
bin | 101111010001111001… |
… | …1000110111111101001 |
3 | 100201001221222212121002 |
4 | 1132203303012333221 |
5 | 3130414234111014 |
6 | 114350542124345 |
7 | 10223031403523 |
oct | 1364363067751 |
9 | 321057885532 |
10 | 101532332009 |
11 | 3a072399899 |
12 | 17816b806b5 |
13 | 9761112284 |
14 | 4cb277ca13 |
15 | 2993a1ddde |
hex | 17a3cc6fe9 |
101532332009 has 2 divisors, whose sum is σ = 101532332010. Its totient is φ = 101532332008.
The previous prime is 101532331963. The next prime is 101532332017. The reversal of 101532332009 is 900233235101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95004499984 + 6527832025 = 308228^2 + 80795^2 .
It is a cyclic number.
It is not a de Polignac number, because 101532332009 - 28 = 101532331753 is a prime.
It is not a weakly prime, because it can be changed into another prime (101532332809) 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, 50766166004 + 50766166005.
It is an arithmetic number, because the mean of its divisors is an integer number (50766166005).
Almost surely, 2101532332009 is an apocalyptic number.
It is an amenable number.
101532332009 is a deficient number, since it is larger than the sum of its proper divisors (1).
101532332009 is an equidigital number, since it uses as much as digits as its factorization.
101532332009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 29.
The spelling of 101532332009 in words is "one hundred one billion, five hundred thirty-two million, three hundred thirty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •