Base | Representation |
---|---|
bin | 101000101011… |
… | …0110010011101 |
3 | 1111010112011002 |
4 | 1101112302131 |
5 | 20424431010 |
6 | 2041040045 |
7 | 346163600 |
oct | 121266235 |
9 | 44115132 |
10 | 21327005 |
11 | 11047327 |
12 | 7186025 |
13 | 455943b |
14 | 2b92337 |
15 | 1d141a5 |
hex | 1456c9d |
21327005 has 12 divisors (see below), whose sum is σ = 29771100. Its totient is φ = 14624064.
The previous prime is 21327001. The next prime is 21327013. The reversal of 21327005 is 50072312.
It can be written as a sum of positive squares in 2 ways, for example, as 10686361 + 10640644 = 3269^2 + 3262^2 .
It is not a de Polignac number, because 21327005 - 22 = 21327001 is a prime.
It is a super-2 number, since 2×213270052 = 909682284540050, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21327001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43280 + ... + 43769.
It is an arithmetic number, because the mean of its divisors is an integer number (2480925).
Almost surely, 221327005 is an apocalyptic number.
It is an amenable number.
21327005 is a deficient number, since it is larger than the sum of its proper divisors (8444095).
21327005 is an equidigital number, since it uses as much as digits as its factorization.
21327005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87068 (or 87061 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 20.
The square root of 21327005 is about 4618.1170405264. The cubic root of 21327005 is about 277.3170831452.
Adding to 21327005 its reverse (50072312), we get a palindrome (71399317).
The spelling of 21327005 in words is "twenty-one million, three hundred twenty-seven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •