Base | Representation |
---|---|
bin | 1010000001011100101100… |
… | …1100001111111011000001 |
3 | 1110000111112202101000210002 |
4 | 2200113023030033323001 |
5 | 2421022430011200113 |
6 | 35234303531045345 |
7 | 2215111606215011 |
oct | 240271314177301 |
9 | 43014482330702 |
10 | 11020000100033 |
11 | 3569612847101 |
12 | 129b8bb8a0855 |
13 | 61c248b35382 |
14 | 2a1529885c41 |
15 | 1419c7444c58 |
hex | a05cb30fec1 |
11020000100033 has 2 divisors, whose sum is σ = 11020000100034. Its totient is φ = 11020000100032.
The previous prime is 11020000099937. The next prime is 11020000100077. The reversal of 11020000100033 is 33000100002011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9486843525184 + 1533156574849 = 3080072^2 + 1238207^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020000100033 - 28 = 11020000099777 is a prime.
It is a super-3 number, since 3×110200001000333 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020000099987 and 11020000100023.
It is not a weakly prime, because it can be changed into another prime (11020000105033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510000050016 + 5510000050017.
It is an arithmetic number, because the mean of its divisors is an integer number (5510000050017).
Almost surely, 211020000100033 is an apocalyptic number.
It is an amenable number.
11020000100033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020000100033 is an equidigital number, since it uses as much as digits as its factorization.
11020000100033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 11020000100033 its reverse (33000100002011), we get a palindrome (44020100102044).
The spelling of 11020000100033 in words is "eleven trillion, twenty billion, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.637 sec. • engine limits •