Base | Representation |
---|---|
bin | 10100011111100010… |
… | …11000100010010001 |
3 | 1001101202020121221112 |
4 | 22033301120202101 |
5 | 140013004201113 |
6 | 5015415303105 |
7 | 536432433662 |
oct | 121761304221 |
9 | 31352217845 |
10 | 11002022033 |
11 | 4736399aa2 |
12 | 217067aa95 |
13 | 1064484b12 |
14 | 765279369 |
15 | 445d3d5a8 |
hex | 28fc58891 |
11002022033 has 4 divisors (see below), whose sum is σ = 11023058928. Its totient is φ = 10980985140.
The previous prime is 11002022021. The next prime is 11002022069. The reversal of 11002022033 is 33022020011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33022020011 = 911 ⋅36248101.
It is a cyclic number.
It is not a de Polignac number, because 11002022033 - 212 = 11002017937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11002021999 and 11002022017.
It is not an unprimeable number, because it can be changed into a prime (11002022093) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10517663 + ... + 10518708.
It is an arithmetic number, because the mean of its divisors is an integer number (2755764732).
Almost surely, 211002022033 is an apocalyptic number.
It is an amenable number.
11002022033 is a deficient number, since it is larger than the sum of its proper divisors (21036895).
11002022033 is an equidigital number, since it uses as much as digits as its factorization.
11002022033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21036894.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 11002022033 its reverse (33022020011), we get a palindrome (44024042044).
The spelling of 11002022033 in words is "eleven billion, two million, twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •