Base | Representation |
---|---|
bin | 110110011100… |
… | …001010010101 |
3 | 222212001022012 |
4 | 312130022111 |
5 | 12123134000 |
6 | 1225514005 |
7 | 232205531 |
oct | 66341225 |
9 | 28761265 |
10 | 14271125 |
11 | 8068120 |
12 | 4942905 |
13 | 2c5896b |
14 | 1c76bc1 |
15 | 13bd735 |
hex | d9c295 |
14271125 has 32 divisors (see below), whose sum is σ = 19813248. Its totient is φ = 10176000.
The previous prime is 14271121. The next prime is 14271137. The reversal of 14271125 is 52117241.
14271125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14271125 - 22 = 14271121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14271125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14271121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133322 + ... + 133428.
It is an arithmetic number, because the mean of its divisors is an integer number (619164).
Almost surely, 214271125 is an apocalyptic number.
It is an amenable number.
14271125 is a deficient number, since it is larger than the sum of its proper divisors (5542123).
14271125 is a wasteful number, since it uses less digits than its factorization.
14271125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230 (or 220 counting only the distinct ones).
The product of its digits is 560, while the sum is 23.
The square root of 14271125 is about 3777.7142560019. The cubic root of 14271125 is about 242.5601225497.
Adding to 14271125 its reverse (52117241), we get a palindrome (66388366).
It can be divided in two parts, 1427 and 1125, that added together give a palindrome (2552).
The spelling of 14271125 in words is "fourteen million, two hundred seventy-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •