Base | Representation |
---|---|
bin | 1001101000000010000011… |
… | …10101010000011011001101 |
3 | 2202221111221221120202010012 |
4 | 10310001001311100123031 |
5 | 10233243402022032022 |
6 | 113003503235123005 |
7 | 4313146432410326 |
oct | 464010165203315 |
9 | 82844857522105 |
10 | 21166703314637 |
11 | 682082622a641 |
12 | 245a2ba143465 |
13 | ba701c514c4a |
14 | 53268c58544d |
15 | 26a8db7ebde2 |
hex | 134041d506cd |
21166703314637 has 4 divisors (see below), whose sum is σ = 21167545929756. Its totient is φ = 21165860699520.
The previous prime is 21166703314607. The next prime is 21166703314639. The reversal of 21166703314637 is 73641330766112.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5078109013156 + 16088594301481 = 2253466^2 + 4011059^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21166703314637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21166703314639) 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, 421269878 + ... + 421320119.
It is an arithmetic number, because the mean of its divisors is an integer number (5291886482439).
Almost surely, 221166703314637 is an apocalyptic number.
It is an amenable number.
21166703314637 is a deficient number, since it is larger than the sum of its proper divisors (842615119).
21166703314637 is an equidigital number, since it uses as much as digits as its factorization.
21166703314637 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 842615118.
The product of its (nonzero) digits is 2286144, while the sum is 50.
The spelling of 21166703314637 in words is "twenty-one trillion, one hundred sixty-six billion, seven hundred three million, three hundred fourteen thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •