Base | Representation |
---|---|
bin | 11010010100110010… |
… | …10100010000001001 |
3 | 1100110221211110012010 |
4 | 31022121110100021 |
5 | 212421030134200 |
6 | 10254224210133 |
7 | 1010141651322 |
oct | 151231242011 |
9 | 40427743163 |
10 | 14133052425 |
11 | 5aa2815518 |
12 | 28a5169949 |
13 | 1443055b1b |
14 | 98102d449 |
15 | 57ab66150 |
hex | 34a654409 |
14133052425 has 48 divisors (see below), whose sum is σ = 24785324352. Its totient is φ = 7081574400.
The previous prime is 14133052369. The next prime is 14133052429. The reversal of 14133052425 is 52425033141.
It is not a de Polignac number, because 14133052425 - 211 = 14133050377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14133052392 and 14133052401.
It is not an unprimeable number, because it can be changed into a prime (14133052429) 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 47 ways as a sum of consecutive naturals, for example, 726070 + ... + 745280.
It is an arithmetic number, because the mean of its divisors is an integer number (516360924).
Almost surely, 214133052425 is an apocalyptic number.
14133052425 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14133052425 is a deficient number, since it is larger than the sum of its proper divisors (10652271927).
14133052425 is a wasteful number, since it uses less digits than its factorization.
14133052425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19818 (or 19813 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 14133052425 its reverse (52425033141), we get a palindrome (66558085566).
The spelling of 14133052425 in words is "fourteen billion, one hundred thirty-three million, fifty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •