Base | Representation |
---|---|
bin | 10100011111100010… |
… | …11000100011010110 |
3 | 1001101202020122001002 |
4 | 22033301120203112 |
5 | 140013004201402 |
6 | 5015415303302 |
7 | 536432434121 |
oct | 121761304326 |
9 | 31352218032 |
10 | 11002022102 |
11 | 473639a055 |
12 | 217067ab32 |
13 | 1064484b66 |
14 | 7652793b8 |
15 | 445d3d602 |
hex | 28fc588d6 |
11002022102 has 8 divisors (see below), whose sum is σ = 16522942800. Its totient is φ = 5494374504.
The previous prime is 11002022093. The next prime is 11002022111. The reversal of 11002022102 is 20122020011.
It is a happy number.
11002022102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11002022093) and next prime (11002022111).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3316202 + ... + 3319517.
It is an arithmetic number, because the mean of its divisors is an integer number (2065367850).
Almost surely, 211002022102 is an apocalyptic number.
11002022102 is a deficient number, since it is larger than the sum of its proper divisors (5520920698).
11002022102 is an equidigital number, since it uses as much as digits as its factorization.
11002022102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6636550.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 11002022102 its reverse (20122020011), we get a palindrome (31124042113).
It can be divided in two parts, 1100 and 2022102, that added together give a palindrome (2023202).
The spelling of 11002022102 in words is "eleven billion, two million, twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •