Base | Representation |
---|---|
bin | 1010000000010010100100… |
… | …1011000001100101111101 |
3 | 1102221121012000120212102000 |
4 | 2200010221023001211331 |
5 | 2420211202103013041 |
6 | 35221213241452513 |
7 | 2213505532161360 |
oct | 240045113014575 |
9 | 42847160525360 |
10 | 11000102001021 |
11 | 3561131897881 |
12 | 1297a87aa1139 |
13 | 61a3c75b85a3 |
14 | 2a059cd280d7 |
15 | 141210606bb6 |
hex | a01292c197d |
11000102001021 has 16 divisors (see below), whose sum is σ = 18624511324800. Its totient is φ = 6285772571904.
The previous prime is 11000102001019. The next prime is 11000102001079. The reversal of 11000102001021 is 12010020100011.
It is a happy number.
It is not a de Polignac number, because 11000102001021 - 21 = 11000102001019 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 = 11000102000994 and 11000102001012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000102001001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29100798756 + ... + 29100799133.
It is an arithmetic number, because the mean of its divisors is an integer number (1164031957800).
Almost surely, 211000102001021 is an apocalyptic number.
It is an amenable number.
11000102001021 is a deficient number, since it is larger than the sum of its proper divisors (7624409323779).
11000102001021 is an equidigital number, since it uses as much as digits as its factorization.
11000102001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58201597905 (or 58201597899 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11000102001021 its reverse (12010020100011), we get a palindrome (23010122101032).
The spelling of 11000102001021 in words is "eleven trillion, one hundred two million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •