Base | Representation |
---|---|
bin | 1010000001100111111000… |
… | …0001001001010011111001 |
3 | 1110000210021211210112120000 |
4 | 2200121332001021103321 |
5 | 2421100101034423113 |
6 | 35235521344023213 |
7 | 2215246136456604 |
oct | 240317601112371 |
9 | 43023254715500 |
10 | 11023000311033 |
11 | 356a912341027 |
12 | 12a03b8601b09 |
13 | 61c606591959 |
14 | 2a173210533b |
15 | 141b00a2b373 |
hex | a067e0494f9 |
11023000311033 has 40 divisors (see below), whose sum is σ = 17339762800800. Its totient is φ = 6959223983232.
The previous prime is 11023000311019. The next prime is 11023000311077. The reversal of 11023000311033 is 33011300032011.
It is a happy number.
It is not a de Polignac number, because 11023000311033 - 29 = 11023000310521 is a prime.
It is a super-2 number, since 2×110230003110332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11023000310997 and 11023000311015.
It is not an unprimeable number, because it can be changed into a prime (11023000311013) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2642610 + ... + 5387892.
It is an arithmetic number, because the mean of its divisors is an integer number (433494070020).
Almost surely, 211023000311033 is an apocalyptic number.
It is an amenable number.
11023000311033 is a deficient number, since it is larger than the sum of its proper divisors (6316762489767).
11023000311033 is a wasteful number, since it uses less digits than its factorization.
11023000311033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2747923 (or 2747914 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 11023000311033 its reverse (33011300032011), we get a palindrome (44034300343044).
The spelling of 11023000311033 in words is "eleven trillion, twenty-three billion, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •