Base | Representation |
---|---|
bin | 1001110011001100100100… |
… | …00000001001000010101101 |
3 | 2211022012002111020110210202 |
4 | 10321212102000021002231 |
5 | 10311040003402401410 |
6 | 113500023224443245 |
7 | 4352646351212555 |
oct | 471462200110255 |
9 | 84265074213722 |
10 | 21550300434605 |
11 | 6959481864438 |
12 | 2500714019525 |
13 | c0425278a8c7 |
14 | 54707c0a2165 |
15 | 27588d16cca5 |
hex | 1399920090ad |
21550300434605 has 8 divisors (see below), whose sum is σ = 25958688890112. Its totient is φ = 17174688101968.
The previous prime is 21550300434587. The next prime is 21550300434623. The reversal of 21550300434605 is 50643400305512.
It is an interprime number because it is at equal distance from previous prime (21550300434587) and next prime (21550300434623).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21550300434605 - 218 = 21550300172461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 8194029269 + ... + 8194031898.
It is an arithmetic number, because the mean of its divisors is an integer number (3244836111264).
Almost surely, 221550300434605 is an apocalyptic number.
It is an amenable number.
21550300434605 is a deficient number, since it is larger than the sum of its proper divisors (4408388455507).
21550300434605 is a wasteful number, since it uses less digits than its factorization.
21550300434605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16388061435.
The product of its (nonzero) digits is 216000, while the sum is 38.
The spelling of 21550300434605 in words is "twenty-one trillion, five hundred fifty billion, three hundred million, four hundred thirty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •