Base | Representation |
---|---|
bin | 1001101001011110101011… |
… | …11100111101101110110101 |
3 | 2210010021022200202200111102 |
4 | 10310233111330331232311 |
5 | 10240102223322102240 |
6 | 113042410023015445 |
7 | 4316556662654651 |
oct | 464572574755665 |
9 | 83107280680442 |
10 | 21216433003445 |
11 | 683a925356909 |
12 | 2467a7859a585 |
13 | bab916280304 |
14 | 534c4902da61 |
15 | 26bd4c599815 |
hex | 134bd5f3dbb5 |
21216433003445 has 8 divisors (see below), whose sum is σ = 25460874948480. Its totient is φ = 16972376173200.
The previous prime is 21216433003439. The next prime is 21216433003477. The reversal of 21216433003445 is 54430033461212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21216433003445 - 210 = 21216433002421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21216433003399 and 21216433003408.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96157481 + ... + 96377870.
It is an arithmetic number, because the mean of its divisors is an integer number (3182609368560).
Almost surely, 221216433003445 is an apocalyptic number.
It is an amenable number.
21216433003445 is a deficient number, since it is larger than the sum of its proper divisors (4244441945035).
21216433003445 is a wasteful number, since it uses less digits than its factorization.
21216433003445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192557395.
The product of its (nonzero) digits is 207360, while the sum is 38.
Adding to 21216433003445 its reverse (54430033461212), we get a palindrome (75646466464657).
The spelling of 21216433003445 in words is "twenty-one trillion, two hundred sixteen billion, four hundred thirty-three million, three thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •