Base | Representation |
---|---|
bin | 10000010100111110001… |
… | …100111001010010100001 |
3 | 10222021011012110100102002 |
4 | 100110332030321102201 |
5 | 121340404142011113 |
6 | 2215241541333345 |
7 | 144030643624121 |
oct | 20247614712241 |
9 | 3867135410362 |
10 | 1122030032033 |
11 | 3a293977a139 |
12 | 161559707255 |
13 | 81a64c139a1 |
14 | 3c441224c81 |
15 | 1e2bea62c58 |
hex | 1053e3394a1 |
1122030032033 has 2 divisors, whose sum is σ = 1122030032034. Its totient is φ = 1122030032032.
The previous prime is 1122030032029. The next prime is 1122030032063. The reversal of 1122030032033 is 3302300302211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 885919560289 + 236110471744 = 941233^2 + 485912^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122030032033 - 22 = 1122030032029 is a prime.
It is a super-2 number, since 2×11220300320332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122030031996 and 1122030032014.
It is not a weakly prime, because it can be changed into another prime (1122030032063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561015016016 + 561015016017.
It is an arithmetic number, because the mean of its divisors is an integer number (561015016017).
Almost surely, 21122030032033 is an apocalyptic number.
It is an amenable number.
1122030032033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122030032033 is an equidigital number, since it uses as much as digits as its factorization.
1122030032033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 1122030032033 its reverse (3302300302211), we get a palindrome (4424330334244).
The spelling of 1122030032033 in words is "one trillion, one hundred twenty-two billion, thirty million, thirty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •