Base | Representation |
---|---|
bin | 101000100100… |
… | …1000110100111 |
3 | 1111000200021000 |
4 | 1101021012213 |
5 | 20421132301 |
6 | 2035524343 |
7 | 345541302 |
oct | 121110647 |
9 | 44020230 |
10 | 21270951 |
11 | 110091a9 |
12 | 71596b3 |
13 | 4539a80 |
14 | 2b79b39 |
15 | 1d02786 |
hex | 14491a7 |
21270951 has 16 divisors (see below), whose sum is σ = 33937120. Its totient is φ = 13089600.
The previous prime is 21270947. The next prime is 21270971. The reversal of 21270951 is 15907212.
It is not a de Polignac number, because 21270951 - 22 = 21270947 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21270941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29950 + ... + 30651.
It is an arithmetic number, because the mean of its divisors is an integer number (2121070).
Almost surely, 221270951 is an apocalyptic number.
21270951 is a deficient number, since it is larger than the sum of its proper divisors (12666169).
21270951 is a wasteful number, since it uses less digits than its factorization.
21270951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60623 (or 60617 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 21270951 is about 4612.0441238132. The cubic root of 21270951 is about 277.0739114716.
The spelling of 21270951 in words is "twenty-one million, two hundred seventy thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •