Base | Representation |
---|---|
bin | 101000011111… |
… | …0011100100101 |
3 | 1110221110101100 |
4 | 1100332130211 |
5 | 20413233201 |
6 | 2034550313 |
7 | 345300114 |
oct | 120763445 |
9 | 43843340 |
10 | 21227301 |
11 | 10a89427 |
12 | 7138399 |
13 | 4522c44 |
14 | 2b67c7b |
15 | 1ce4886 |
hex | 143e725 |
21227301 has 12 divisors (see below), whose sum is σ = 31007340. Its totient is φ = 13992000.
The previous prime is 21227291. The next prime is 21227303. The reversal of 21227301 is 10372212.
It can be written as a sum of positive squares in 2 ways, for example, as 5616900 + 15610401 = 2370^2 + 3951^2 .
It is not a de Polignac number, because 21227301 - 210 = 21226277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21227303) 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, 12450 + ... + 14051.
It is an arithmetic number, because the mean of its divisors is an integer number (2583945).
Almost surely, 221227301 is an apocalyptic number.
It is an amenable number.
21227301 is a deficient number, since it is larger than the sum of its proper divisors (9780039).
21227301 is a wasteful number, since it uses less digits than its factorization.
21227301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26596 (or 26593 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 21227301 is about 4607.3095185802. The cubic root of 21227301 is about 276.8842544045.
Adding to 21227301 its reverse (10372212), we get a palindrome (31599513).
It can be divided in two parts, 21227 and 301, that added together give a triangular number (21528 = T207).
The spelling of 21227301 in words is "twenty-one million, two hundred twenty-seven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •