Base | Representation |
---|---|
bin | 100000110101111… |
… | …0011011101100101 |
3 | 2211210121111120200 |
4 | 1001223303131211 |
5 | 4224103031041 |
6 | 301203421113 |
7 | 36210601611 |
oct | 10153633545 |
9 | 2753544520 |
10 | 1102002021 |
11 | 51606247a |
12 | 269084799 |
13 | 147402003 |
14 | a6500341 |
15 | 66b2e1b6 |
hex | 41af3765 |
1102002021 has 12 divisors (see below), whose sum is σ = 1594575840. Its totient is φ = 733377960.
The previous prime is 1102001983. The next prime is 1102002037. The reversal of 1102002021 is 1202002011.
It is not a de Polignac number, because 1102002021 - 211 = 1101999973 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1102001994 and 1102002012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102002061) 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 11 ways as a sum of consecutive naturals, for example, 102081 + ... + 112358.
It is an arithmetic number, because the mean of its divisors is an integer number (132881320).
Almost surely, 21102002021 is an apocalyptic number.
It is an amenable number.
1102002021 is a deficient number, since it is larger than the sum of its proper divisors (492573819).
1102002021 is a wasteful number, since it uses less digits than its factorization.
1102002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215016 (or 215013 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 1102002021 is about 33196.4157854429. The cubic root of 1102002021 is about 1032.9059924129.
Adding to 1102002021 its reverse (1202002011), we get a palindrome (2304004032).
The spelling of 1102002021 in words is "one billion, one hundred two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •