Base | Representation |
---|---|
bin | 10000011111001101111… |
… | …010110000101111111101 |
3 | 11000022112212222010201211 |
4 | 100133031322300233331 |
5 | 122030421432212112 |
6 | 2224301325204421 |
7 | 144600365501251 |
oct | 20371572605775 |
9 | 4008485863654 |
10 | 1133031132157 |
11 | 3a7574599521 |
12 | 163709a00711 |
13 | 82ac9134ca2 |
14 | 3cba6300261 |
15 | 1e71576d0a7 |
hex | 107cdeb0bfd |
1133031132157 has 2 divisors, whose sum is σ = 1133031132158. Its totient is φ = 1133031132156.
The previous prime is 1133031132097. The next prime is 1133031132173. The reversal of 1133031132157 is 7512311303311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1022664990361 + 110366141796 = 1011269^2 + 332214^2 .
It is a cyclic number.
It is not a de Polignac number, because 1133031132157 - 223 = 1133022743549 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133031132187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 566515566078 + 566515566079.
It is an arithmetic number, because the mean of its divisors is an integer number (566515566079).
Almost surely, 21133031132157 is an apocalyptic number.
It is an amenable number.
1133031132157 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133031132157 is an equidigital number, since it uses as much as digits as its factorization.
1133031132157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5670, while the sum is 31.
Adding to 1133031132157 its reverse (7512311303311), we get a palindrome (8645342435468).
The spelling of 1133031132157 in words is "one trillion, one hundred thirty-three billion, thirty-one million, one hundred thirty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •