Base | Representation |
---|---|
bin | 11010011101000000… |
… | …10101101011001101 |
3 | 1100122202120110101201 |
4 | 31032200111223031 |
5 | 213041203032000 |
6 | 10305130105501 |
7 | 1011640012003 |
oct | 151640255315 |
9 | 40582513351 |
10 | 14202002125 |
11 | 6028729443 |
12 | 290427b291 |
13 | 145441756c |
14 | 98a25aa73 |
15 | 581c3596a |
hex | 34e815acd |
14202002125 has 8 divisors (see below), whose sum is σ = 17724098808. Its totient is φ = 11361601600.
The previous prime is 14202002107. The next prime is 14202002179. The reversal of 14202002125 is 52120020241.
14202002125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 144817156 + 14057184969 = 12034^2 + 118563^2 .
It is not a de Polignac number, because 14202002125 - 213 = 14201993933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56807884 + ... + 56808133.
It is an arithmetic number, because the mean of its divisors is an integer number (2215512351).
Almost surely, 214202002125 is an apocalyptic number.
It is an amenable number.
14202002125 is a deficient number, since it is larger than the sum of its proper divisors (3522096683).
14202002125 is an equidigital number, since it uses as much as digits as its factorization.
14202002125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113616032 (or 113616022 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 19.
Adding to 14202002125 its reverse (52120020241), we get a palindrome (66322022366).
The spelling of 14202002125 in words is "fourteen billion, two hundred two million, two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •