Base | Representation |
---|---|
bin | 101110101011011001… |
… | …0100001010110100101 |
3 | 100120201220212111001012 |
4 | 1131112302201112211 |
5 | 3120243011112242 |
6 | 114014430112005 |
7 | 10146022523315 |
oct | 1352662412645 |
9 | 316656774035 |
10 | 100240332197 |
11 | 3956a066255 |
12 | 1751634b605 |
13 | 95b6548845 |
14 | 4bccd41445 |
15 | 291a3ae282 |
hex | 1756ca15a5 |
100240332197 has 2 divisors, whose sum is σ = 100240332198. Its totient is φ = 100240332196.
The previous prime is 100240332167. The next prime is 100240332223. The reversal of 100240332197 is 791233042001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76931897956 + 23308434241 = 277366^2 + 152671^2 .
It is an emirp because it is prime and its reverse (791233042001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100240332197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100240332167) 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, 50120166098 + 50120166099.
It is an arithmetic number, because the mean of its divisors is an integer number (50120166099).
Almost surely, 2100240332197 is an apocalyptic number.
It is an amenable number.
100240332197 is a deficient number, since it is larger than the sum of its proper divisors (1).
100240332197 is an equidigital number, since it uses as much as digits as its factorization.
100240332197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
Adding to 100240332197 its reverse (791233042001), we get a palindrome (891473374198).
The spelling of 100240332197 in words is "one hundred billion, two hundred forty million, three hundred thirty-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •