Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …1010100111010000111101 |
3 | 1110000121010120211102001211 |
4 | 2200120012322213100331 |
5 | 2421032003020010023 |
6 | 35234551203404421 |
7 | 2215145464156630 |
oct | 240300672472075 |
9 | 43017116742054 |
10 | 11021002110013 |
11 | 3569a87413025 |
12 | 129bb3b383711 |
13 | 61c3785c739c |
14 | 2a15c2997c17 |
15 | 141a353c1a0d |
hex | a0606ea743d |
11021002110013 has 8 divisors (see below), whose sum is σ = 12598045808832. Its totient is φ = 9444612117696.
The previous prime is 11021002110011. The next prime is 11021002110071. The reversal of 11021002110013 is 31001120012011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11021002110013 - 21 = 11021002110011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021002109975 and 11021002110002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021002110011) 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, 163390495 + ... + 163457932.
It is an arithmetic number, because the mean of its divisors is an integer number (1574755726104).
Almost surely, 211021002110013 is an apocalyptic number.
It is an amenable number.
11021002110013 is a deficient number, since it is larger than the sum of its proper divisors (1577043698819).
11021002110013 is an equidigital number, since it uses as much as digits as its factorization.
11021002110013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 326853251.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11021002110013 its reverse (31001120012011), we get a palindrome (42022122122024).
The spelling of 11021002110013 in words is "eleven trillion, twenty-one billion, two million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •