Base | Representation |
---|---|
bin | 101000111100… |
… | …1111110010101 |
3 | 1111101211211212 |
4 | 1101321332111 |
5 | 20444034000 |
6 | 2044111205 |
7 | 350334014 |
oct | 121717625 |
9 | 44354755 |
10 | 21471125 |
11 | 11135635 |
12 | 7235505 |
13 | 45a9c10 |
14 | 2bcca7b |
15 | 1d41c35 |
hex | 1479f95 |
21471125 has 32 divisors (see below), whose sum is σ = 29414112. Its totient is φ = 15552000.
The previous prime is 21471097. The next prime is 21471133. The reversal of 21471125 is 52117412.
It can be written as a sum of positive squares in 16 ways, for example, as 21362884 + 108241 = 4622^2 + 329^2 .
It is not a de Polignac number, because 21471125 - 212 = 21467029 is a prime.
It is a super-2 number, since 2×214711252 = 922018417531250, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 21471125.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118535 + ... + 118715.
It is an arithmetic number, because the mean of its divisors is an integer number (919191).
Almost surely, 221471125 is an apocalyptic number.
21471125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
21471125 is a deficient number, since it is larger than the sum of its proper divisors (7942987).
21471125 is a wasteful number, since it uses less digits than its factorization.
21471125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282 (or 272 counting only the distinct ones).
The product of its digits is 560, while the sum is 23.
The square root of 21471125 is about 4633.6945302857. The cubic root of 21471125 is about 277.9403500196.
Adding to 21471125 its reverse (52117412), we get a palindrome (73588537).
The spelling of 21471125 in words is "twenty-one million, four hundred seventy-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •