Base | Representation |
---|---|
bin | 10101000110111001… |
… | …01001100110100001 |
3 | 1002020202101220122012 |
4 | 22203130221212201 |
5 | 141202011144413 |
6 | 5112250522305 |
7 | 550551345323 |
oct | 124334514641 |
9 | 32222356565 |
10 | 11332131233 |
11 | 4895768a15 |
12 | 2243136395 |
13 | 10b79954c7 |
14 | 797049613 |
15 | 464ce87a8 |
hex | 2a37299a1 |
11332131233 has 2 divisors, whose sum is σ = 11332131234. Its totient is φ = 11332131232.
The previous prime is 11332131199. The next prime is 11332131247. The reversal of 11332131233 is 33213123311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11331176704 + 954529 = 106448^2 + 977^2 .
It is an emirp because it is prime and its reverse (33213123311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11332131233 - 26 = 11332131169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11332131199 and 11332131208.
It is not a weakly prime, because it can be changed into another prime (11332139233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666065616 + 5666065617.
It is an arithmetic number, because the mean of its divisors is an integer number (5666065617).
Almost surely, 211332131233 is an apocalyptic number.
It is an amenable number.
11332131233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11332131233 is an equidigital number, since it uses as much as digits as its factorization.
11332131233 is an evil number, because the sum of its binary digits is even.
The product of its digits is 972, while the sum is 23.
Adding to 11332131233 its reverse (33213123311), we get a palindrome (44545254544).
It can be divided in two parts, 11 and 332131233, that multiplied together give a palindrome (3653443563).
The spelling of 11332131233 in words is "eleven billion, three hundred thirty-two million, one hundred thirty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •