Base | Representation |
---|---|
bin | 101000000111… |
… | …0110101101101 |
3 | 1110120112220010 |
4 | 1100032311231 |
5 | 20341013201 |
6 | 2030443433 |
7 | 343525443 |
oct | 120166555 |
9 | 43515803 |
10 | 21032301 |
11 | 10965974 |
12 | 7063579 |
13 | 4485264 |
14 | 2b16b93 |
15 | 1ca6bd6 |
hex | 140ed6d |
21032301 has 8 divisors (see below), whose sum is σ = 28066624. Its totient is φ = 14009760.
The previous prime is 21032299. The next prime is 21032309. The reversal of 21032301 is 10323012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21032301 - 21 = 21032299 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21032309) 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 7 ways as a sum of consecutive naturals, for example, 2856 + ... + 7086.
It is an arithmetic number, because the mean of its divisors is an integer number (3508328).
Almost surely, 221032301 is an apocalyptic number.
It is an amenable number.
21032301 is a deficient number, since it is larger than the sum of its proper divisors (7034323).
21032301 is a wasteful number, since it uses less digits than its factorization.
21032301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5891.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 21032301 is about 4586.0986688034. The cubic root of 21032301 is about 276.0337991584.
Adding to 21032301 its reverse (10323012), we get a palindrome (31355313).
It can be divided in two parts, 2 and 1032301, that multiplied together give a palindrome (2064602).
The spelling of 21032301 in words is "twenty-one million, thirty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •