Base | Representation |
---|---|
bin | 1010001101110010111100… |
… | …0111100110100110110101 |
3 | 1110202210002110012112201012 |
4 | 2203130233013212212311 |
5 | 2433011400240020313 |
6 | 35515545211042005 |
7 | 2236331436505523 |
oct | 243345707464665 |
9 | 43683073175635 |
10 | 11232130001333 |
11 | 364057962371a |
12 | 1314a41740305 |
13 | 63625419b927 |
14 | 2ab8d091b313 |
15 | 147290748da8 |
hex | a372f1e69b5 |
11232130001333 has 2 divisors, whose sum is σ = 11232130001334. Its totient is φ = 11232130001332.
The previous prime is 11232130001317. The next prime is 11232130001387. The reversal of 11232130001333 is 33310003123211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7508685079204 + 3723444922129 = 2740198^2 + 1929623^2 .
It is a cyclic number.
It is not a de Polignac number, because 11232130001333 - 24 = 11232130001317 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11232130001299 and 11232130001308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11232130001303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616065000666 + 5616065000667.
It is an arithmetic number, because the mean of its divisors is an integer number (5616065000667).
Almost surely, 211232130001333 is an apocalyptic number.
It is an amenable number.
11232130001333 is a deficient number, since it is larger than the sum of its proper divisors (1).
11232130001333 is an equidigital number, since it uses as much as digits as its factorization.
11232130001333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11232130001333 its reverse (33310003123211), we get a palindrome (44542133124544).
The spelling of 11232130001333 in words is "eleven trillion, two hundred thirty-two billion, one hundred thirty million, one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •