Base | Representation |
---|---|
bin | 1001101101110001110111… |
… | …10101010101000101011101 |
3 | 2210122101122211011221202102 |
4 | 10312320323311111011131 |
5 | 10300012310304303140 |
6 | 113234321552334445 |
7 | 4333340035431041 |
oct | 466707365250535 |
9 | 83571584157672 |
10 | 21364171166045 |
11 | 689754872a054 |
12 | 2490629844425 |
13 | bbc82c059a36 |
14 | 53c062248021 |
15 | 270ae77e4e15 |
hex | 136e3bd5515d |
21364171166045 has 16 divisors (see below), whose sum is σ = 25738200362160. Its totient is φ = 17023881068544.
The previous prime is 21364171166003. The next prime is 21364171166047. The reversal of 21364171166045 is 54066117146312.
It can be written as a sum of positive squares in 8 ways, for example, as 14436147057049 + 6928024108996 = 3799493^2 + 2632114^2 .
It is a cyclic number.
It is not a de Polignac number, because 21364171166045 - 210 = 21364171165021 is a prime.
It is a super-2 number, since 2×213641711660452 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21364171166047) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22968239 + ... + 23880291.
It is an arithmetic number, because the mean of its divisors is an integer number (1608637522635).
Almost surely, 221364171166045 is an apocalyptic number.
It is an amenable number.
21364171166045 is a deficient number, since it is larger than the sum of its proper divisors (4374029196115).
21364171166045 is a wasteful number, since it uses less digits than its factorization.
21364171166045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 930544.
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 21364171166045 in words is "twenty-one trillion, three hundred sixty-four billion, one hundred seventy-one million, one hundred sixty-six thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •