Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110010000101111010000 |
3 | 1111010020122001221020012012 |
4 | 2210320330012100233100 |
5 | 2441122124243014412 |
6 | 40033241123322052 |
7 | 2246435004562661 |
oct | 244707406205720 |
9 | 44106561836165 |
10 | 11331132001232 |
11 | 367956268154a |
12 | 1330071220328 |
13 | 6426a0cc1564 |
14 | 2b26031d1368 |
15 | 149b37049c22 |
hex | a4e3c190bd0 |
11331132001232 has 10 divisors (see below), whose sum is σ = 21954068252418. Its totient is φ = 5665566000608.
The previous prime is 11331132001223. The next prime is 11331132001237. The reversal of 11331132001232 is 23210023113311.
It can be written as a sum of positive squares in only one way, i.e., 10142212179856 + 1188919821376 = 3184684^2 + 1090376^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11331132001198 and 11331132001207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331132001237) 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, 354097875023 + ... + 354097875054.
Almost surely, 211331132001232 is an apocalyptic number.
It is an amenable number.
11331132001232 is a deficient number, since it is larger than the sum of its proper divisors (10622936251186).
11331132001232 is an equidigital number, since it uses as much as digits as its factorization.
11331132001232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708195750085 (or 708195750079 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11331132001232 its reverse (23210023113311), we get a palindrome (34541155114543).
The spelling of 11331132001232 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •