Base | Representation |
---|---|
bin | 1010000000111011001101… |
… | …0110100010100011100101 |
3 | 1102222122100020022022001202 |
4 | 2200032303112202203211 |
5 | 2420401022103210041 |
6 | 35230215510332245 |
7 | 2214343045342103 |
oct | 240166326424345 |
9 | 42878306268052 |
10 | 11011010210021 |
11 | 356581a230738 |
12 | 129a01105a085 |
13 | 61b4454b4a23 |
14 | 2a0d15942c73 |
15 | 14164d0b3a9b |
hex | a03b35a28e5 |
11011010210021 has 8 divisors (see below), whose sum is σ = 11592445720320. Its totient is φ = 10429765565472.
The previous prime is 11011010209987. The next prime is 11011010210041. The reversal of 11011010210021 is 12001201011011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11011010210021 - 214 = 11011010193637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011010209984 and 11011010210011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011010210041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47598005 + ... + 47828778.
It is an arithmetic number, because the mean of its divisors is an integer number (1449055715040).
Almost surely, 211011010210021 is an apocalyptic number.
It is an amenable number.
11011010210021 is a deficient number, since it is larger than the sum of its proper divisors (581435510299).
11011010210021 is an equidigital number, since it uses as much as digits as its factorization.
11011010210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95432875.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11011010210021 its reverse (12001201011011), we get a palindrome (23012211221032).
The spelling of 11011010210021 in words is "eleven trillion, eleven billion, ten million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •