Base | Representation |
---|---|
bin | 1001100011100000000101… |
… | …00000101000010000111111 |
3 | 2202101122010020221122022102 |
4 | 10301300002200220100333 |
5 | 10223221033130314444 |
6 | 112404155202535315 |
7 | 4265665500162362 |
oct | 461600240502077 |
9 | 82348106848272 |
10 | 21011022119999 |
11 | 67707a725990a |
12 | 24340b096753b |
13 | b9543bc50272 |
14 | 528d204920d9 |
15 | 2668290aa84e |
hex | 131c0282843f |
21011022119999 has 4 divisors (see below), whose sum is σ = 22246964597664. Its totient is φ = 19775079642336.
The previous prime is 21011022119959. The next prime is 21011022120017. The reversal of 21011022119999 is 99991122011012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21011022119999 - 212 = 21011022115903 is a prime.
It is a super-5 number, since 5×210110221199995 (a number of 68 digits) contains 55555 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21011022119929) 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 3 ways as a sum of consecutive naturals, for example, 617971238807 + ... + 617971238840.
It is an arithmetic number, because the mean of its divisors is an integer number (5561741149416).
Almost surely, 221011022119999 is an apocalyptic number.
21011022119999 is a deficient number, since it is larger than the sum of its proper divisors (1235942477665).
21011022119999 is a wasteful number, since it uses less digits than its factorization.
21011022119999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1235942477664.
The product of its (nonzero) digits is 52488, while the sum is 47.
The spelling of 21011022119999 in words is "twenty-one trillion, eleven billion, twenty-two million, one hundred nineteen thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •