Base | Representation |
---|---|
bin | 1001100110010011110011… |
… | …01001100111000111101011 |
3 | 2202201212011200101012002222 |
4 | 10303021321221213013223 |
5 | 10231311140110300234 |
6 | 112520353434144255 |
7 | 4305652531535666 |
oct | 463117151470753 |
9 | 82655150335088 |
10 | 21107510243819 |
11 | 67a87102963aa |
12 | 244a93a58208b |
13 | ba1577cc585c |
14 | 52d874d426dd |
15 | 2690c4d3e42e |
hex | 133279a671eb |
21107510243819 has 4 divisors (see below), whose sum is σ = 21130230923160. Its totient is φ = 21084789564480.
The previous prime is 21107510243791. The next prime is 21107510243881. The reversal of 21107510243819 is 91834201570112.
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 21107510243819 - 224 = 21107493466603 is a prime.
It is a super-2 number, since 2×211075102438192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21107510243819.
It is not an unprimeable number, because it can be changed into a prime (21107510243119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11360338277 + ... + 11360340134.
It is an arithmetic number, because the mean of its divisors is an integer number (5282557730790).
Almost surely, 221107510243819 is an apocalyptic number.
21107510243819 is a deficient number, since it is larger than the sum of its proper divisors (22720679341).
21107510243819 is an equidigital number, since it uses as much as digits as its factorization.
21107510243819 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22720679340.
The product of its (nonzero) digits is 120960, while the sum is 44.
The spelling of 21107510243819 in words is "twenty-one trillion, one hundred seven billion, five hundred ten million, two hundred forty-three thousand, eight hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •