Base | Representation |
---|---|
bin | 11010011110000110… |
… | …01010111011000101 |
3 | 1100200101202100202220 |
4 | 31033003022323011 |
5 | 213101022230000 |
6 | 10310053522553 |
7 | 1012110432000 |
oct | 151703127305 |
9 | 40611670686 |
10 | 14211133125 |
11 | 60328a5722 |
12 | 2907343459 |
13 | 1456293717 |
14 | 98b556537 |
15 | 58293b1a0 |
hex | 34f0caec5 |
14211133125 has 160 divisors (see below), whose sum is σ = 29090688000. Its totient is φ = 6149304000.
The previous prime is 14211133099. The next prime is 14211133127. The reversal of 14211133125 is 52133111241.
It is not a de Polignac number, because 14211133125 - 26 = 14211133061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14211133095 and 14211133104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14211133127) by changing a digit.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 12218794 + ... + 12219956.
It is an arithmetic number, because the mean of its divisors is an integer number (181816800).
Almost surely, 214211133125 is an apocalyptic number.
14211133125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14211133125 is an abundant number, since it is smaller than the sum of its proper divisors (14879554875).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14211133125 is an equidigital number, since it uses as much as digits as its factorization.
14211133125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1226 (or 1197 counting only the distinct ones).
The product of its digits is 720, while the sum is 24.
Adding to 14211133125 its reverse (52133111241), we get a palindrome (66344244366).
The spelling of 14211133125 in words is "fourteen billion, two hundred eleven million, one hundred thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •