Base | Representation |
---|---|
bin | 10000011111001110000… |
… | …001100101100010001111 |
3 | 11000022120000100000212211 |
4 | 100133032001211202033 |
5 | 122030422411434411 |
6 | 2224301431411251 |
7 | 144600416632231 |
oct | 20371601454217 |
9 | 4008500300784 |
10 | 1133032921231 |
11 | 3a75756006a2 |
12 | 16370a523b27 |
13 | 82ac9610403 |
14 | 3cba6648251 |
15 | 1e7159c3221 |
hex | 107ce06588f |
1133032921231 has 2 divisors, whose sum is σ = 1133032921232. Its totient is φ = 1133032921230.
The previous prime is 1133032921151. The next prime is 1133032921249. The reversal of 1133032921231 is 1321292303311.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1133032921231 - 213 = 1133032913039 is a prime.
It is a super-3 number, since 3×11330329212313 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1133032921193 and 1133032921202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133032921261) 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, 566516460615 + 566516460616.
It is an arithmetic number, because the mean of its divisors is an integer number (566516460616).
Almost surely, 21133032921231 is an apocalyptic number.
1133032921231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133032921231 is an equidigital number, since it uses as much as digits as its factorization.
1133032921231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 31.
The spelling of 1133032921231 in words is "one trillion, one hundred thirty-three billion, thirty-two million, nine hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •