Base | Representation |
---|---|
bin | 1001110101110000101011… |
… | …10010100001110000100101 |
3 | 2211121121112001110000102001 |
4 | 10322320111302201300211 |
5 | 10314010431131214021 |
6 | 114004314303445301 |
7 | 4362215664046006 |
oct | 472702562416045 |
9 | 84547461400361 |
10 | 21638410804261 |
11 | 6992886872259 |
12 | 2515803bb6831 |
13 | c0c654c6a204 |
14 | 54b43a0351ad |
15 | 277ce8689091 |
hex | 13ae15ca1c25 |
21638410804261 has 4 divisors (see below), whose sum is σ = 21639609028800. Its totient is φ = 21637212579724.
The previous prime is 21638410804237. The next prime is 21638410804267. The reversal of 21638410804261 is 16240801483612.
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 21638410804261 - 27 = 21638410804133 is a prime.
It is a super-2 number, since 2×216384108042612 (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 (21638410804267) 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, 599085181 + ... + 599121298.
It is an arithmetic number, because the mean of its divisors is an integer number (5409902257200).
Almost surely, 221638410804261 is an apocalyptic number.
It is an amenable number.
21638410804261 is a deficient number, since it is larger than the sum of its proper divisors (1198224539).
21638410804261 is a wasteful number, since it uses less digits than its factorization.
21638410804261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1198224538.
The product of its (nonzero) digits is 442368, while the sum is 46.
The spelling of 21638410804261 in words is "twenty-one trillion, six hundred thirty-eight billion, four hundred ten million, eight hundred four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •