Base | Representation |
---|---|
bin | 10011111111101110… |
… | …001000001010011001 |
3 | 2001102021212200201200 |
4 | 103333232020022121 |
5 | 322432324320241 |
6 | 13510243504413 |
7 | 1360023163233 |
oct | 237756101231 |
9 | 61367780650 |
10 | 21470151321 |
11 | 9118382513 |
12 | 41b2388109 |
13 | 2042148a68 |
14 | 1079659253 |
15 | 859d6b4b6 |
hex | 4ffb88299 |
21470151321 has 12 divisors (see below), whose sum is σ = 31238810772. Its totient is φ = 14208955776.
The previous prime is 21470151317. The next prime is 21470151347. The reversal of 21470151321 is 12315107412.
21470151321 is a `hidden beast` number, since 2 + 147 + 0 + 1 + 513 + 2 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 5508608400 + 15961542921 = 74220^2 + 126339^2 .
It is not a de Polignac number, because 21470151321 - 22 = 21470151317 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21470151301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8705236 + ... + 8707701.
It is an arithmetic number, because the mean of its divisors is an integer number (2603234231).
Almost surely, 221470151321 is an apocalyptic number.
It is an amenable number.
21470151321 is a deficient number, since it is larger than the sum of its proper divisors (9768659451).
21470151321 is a wasteful number, since it uses less digits than its factorization.
21470151321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17413080 (or 17413077 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 27.
Adding to 21470151321 its reverse (12315107412), we get a palindrome (33785258733).
The spelling of 21470151321 in words is "twenty-one billion, four hundred seventy million, one hundred fifty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •