Base | Representation |
---|---|
bin | 10000011110101111100… |
… | …101000101111010100100 |
3 | 11000021020102012102011211 |
4 | 100132233211011322210 |
5 | 122023401131311304 |
6 | 2224135023441204 |
7 | 144551645213155 |
oct | 20365745057244 |
9 | 4007212172154 |
10 | 1132522135204 |
11 | 3a7333247589 |
12 | 1635a7456204 |
13 | 82a4784ca65 |
14 | 3cb5888592c |
15 | 1e6d5c29204 |
hex | 107af945ea4 |
1132522135204 has 6 divisors (see below), whose sum is σ = 1981913736614. Its totient is φ = 566261067600.
The previous prime is 1132522135201. The next prime is 1132522135207. The reversal of 1132522135204 is 4025312252311.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1132522135201) and next prime (1132522135207).
It can be written as a sum of positive squares in only one way, i.e., 927677185600 + 204844949604 = 963160^2 + 452598^2 .
It is a super-2 number, since 2×11325221352042 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1132522135201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 141565266897 + ... + 141565266904.
Almost surely, 21132522135204 is an apocalyptic number.
It is an amenable number.
1132522135204 is a deficient number, since it is larger than the sum of its proper divisors (849391601410).
1132522135204 is a wasteful number, since it uses less digits than its factorization.
1132522135204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283130533805 (or 283130533803 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1132522135204 its reverse (4025312252311), we get a palindrome (5157834387515).
The spelling of 1132522135204 in words is "one trillion, one hundred thirty-two billion, five hundred twenty-two million, one hundred thirty-five thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •