Base | Representation |
---|---|
bin | 11101100111001001000010… |
… | …010101101100010101100101 |
3 | 122002010011102110002221001011 |
4 | 131213021002111230111211 |
5 | 114032214403000112242 |
6 | 1140552133154502221 |
7 | 36301013622300616 |
oct | 3547110225542545 |
9 | 562104373087034 |
10 | 130233111332197 |
11 | 385506091a4385 |
12 | 12734071594971 |
13 | 5788c11731503 |
14 | 242345d9d1c0d |
15 | 100c9de87cd17 |
hex | 76724256c565 |
130233111332197 has 2 divisors, whose sum is σ = 130233111332198. Its totient is φ = 130233111332196.
The previous prime is 130233111332173. The next prime is 130233111332227. The reversal of 130233111332197 is 791233111332031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102184319607876 + 28048791724321 = 10108626^2 + 5296111^2 .
It is a cyclic number.
It is not a de Polignac number, because 130233111332197 - 239 = 129683355518309 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130233111332497) 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, 65116555666098 + 65116555666099.
It is an arithmetic number, because the mean of its divisors is an integer number (65116555666099).
Almost surely, 2130233111332197 is an apocalyptic number.
It is an amenable number.
130233111332197 is a deficient number, since it is larger than the sum of its proper divisors (1).
130233111332197 is an equidigital number, since it uses as much as digits as its factorization.
130233111332197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 61236, while the sum is 40.
The spelling of 130233111332197 in words is "one hundred thirty trillion, two hundred thirty-three billion, one hundred eleven 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 •