Base | Representation |
---|---|
bin | 10100100001110100… |
… | …01100111011011010 |
3 | 1001110002011110002101 |
4 | 22100322030323122 |
5 | 140032401023002 |
6 | 5021340354014 |
7 | 540053616646 |
oct | 122072147332 |
9 | 31402143071 |
10 | 11021111002 |
11 | 4746147900 |
12 | 2176b4590a |
13 | 1068409675 |
14 | 767a07c26 |
15 | 44785e587 |
hex | 290e8ceda |
11021111002 has 12 divisors (see below), whose sum is σ = 18171171018. Its totient is φ = 5009595800.
The previous prime is 11021110957. The next prime is 11021111009. The reversal of 11021111002 is 20011112011.
11021111002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 10894975641 + 126135361 = 104379^2 + 11231^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 11021111002.
It is not an unprimeable number, because it can be changed into a prime (11021111009) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 22770649 + ... + 22771132.
Almost surely, 211021111002 is an apocalyptic number.
11021111002 is a deficient number, since it is larger than the sum of its proper divisors (7150060016).
11021111002 is a wasteful number, since it uses less digits than its factorization.
11021111002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45541805 (or 45541794 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11021111002 its reverse (20011112011), we get a palindrome (31032223013).
It can be divided in two parts, 110 and 21111002, that added together give a palindrome (21111112).
The spelling of 11021111002 in words is "eleven billion, twenty-one million, one hundred eleven thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •