Base | Representation |
---|---|
bin | 1001110110011010110101… |
… | …01110001000010110101101 |
3 | 2211200202221021020202210121 |
4 | 10323031122232020112231 |
5 | 10314343303240203023 |
6 | 114022540111204541 |
7 | 4363646550034516 |
oct | 473153256102655 |
9 | 84622837222717 |
10 | 21661042116013 |
11 | 69a143a632793 |
12 | 251a07b216751 |
13 | c1182082bb41 |
14 | 54c58598da0d |
15 | 2786c041cd5d |
hex | 13b35ab885ad |
21661042116013 has 4 divisors (see below), whose sum is σ = 21816876951520. Its totient is φ = 21505207280508.
The previous prime is 21661042115989. The next prime is 21661042116019. The reversal of 21661042116013 is 31061124016612.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 21661042116013 - 25 = 21661042115981 is a prime.
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 21661042116013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21661042116019) 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, 77917417545 + ... + 77917417822.
It is an arithmetic number, because the mean of its divisors is an integer number (5454219237880).
Almost surely, 221661042116013 is an apocalyptic number.
It is an amenable number.
21661042116013 is a deficient number, since it is larger than the sum of its proper divisors (155834835507).
21661042116013 is a wasteful number, since it uses less digits than its factorization.
21661042116013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155834835506.
The product of its (nonzero) digits is 10368, while the sum is 34.
The spelling of 21661042116013 in words is "twenty-one trillion, six hundred sixty-one billion, forty-two million, one hundred sixteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •