Base | Representation |
---|---|
bin | 1001101001010100110001… |
… | …01011010111000001110111 |
3 | 2210002202120201121122121001 |
4 | 10310222120223113001313 |
5 | 10240010323130322444 |
6 | 113040125512504131 |
7 | 4316311036166356 |
oct | 464523053270167 |
9 | 83082521548531 |
10 | 21211110010999 |
11 | 68386436a08a7 |
12 | 2466a319ab047 |
13 | bab27853343c |
14 | 5348a20d199d |
15 | 26bb3a0e18d4 |
hex | 134a98ad7077 |
21211110010999 has 4 divisors (see below), whose sum is σ = 21218178028000. Its totient is φ = 21204041994000.
The previous prime is 21211110010991. The next prime is 21211110011011. The reversal of 21211110010999 is 99901001111212.
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 21211110010999 - 23 = 21211110010991 is a prime.
It is a super-2 number, since 2×212111100109992 (a number of 27 digits) contains 22 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 (21211110010991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3534003999 + ... + 3534010000.
It is an arithmetic number, because the mean of its divisors is an integer number (5304544507000).
Almost surely, 221211110010999 is an apocalyptic number.
21211110010999 is a deficient number, since it is larger than the sum of its proper divisors (7068017001).
21211110010999 is an equidigital number, since it uses as much as digits as its factorization.
21211110010999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7068017000.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 21211110010999 in words is "twenty-one trillion, two hundred eleven billion, one hundred ten million, ten thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •