Base | Representation |
---|---|
bin | 111111010101100… |
… | …0011110101101001 |
3 | 12111002222012211112 |
4 | 1332223003311221 |
5 | 13323023422004 |
6 | 550514440105 |
7 | 103444022210 |
oct | 17653036551 |
9 | 5432865745 |
10 | 2125217129 |
11 | 9a06a20a2 |
12 | 4b3893035 |
13 | 27b3a9b39 |
14 | 162372077 |
15 | c6898e6e |
hex | 7eac3d69 |
2125217129 has 4 divisors (see below), whose sum is σ = 2428819584. Its totient is φ = 1821614676.
The previous prime is 2125217123. The next prime is 2125217131. The reversal of 2125217129 is 9217125212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 2125217129 - 24 = 2125217113 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2125217095 and 2125217104.
It is not an unprimeable number, because it can be changed into a prime (2125217123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 151801217 + ... + 151801230.
It is an arithmetic number, because the mean of its divisors is an integer number (607204896).
Almost surely, 22125217129 is an apocalyptic number.
It is an amenable number.
2125217129 is a deficient number, since it is larger than the sum of its proper divisors (303602455).
2125217129 is an equidigital number, since it uses as much as digits as its factorization.
2125217129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303602454.
The product of its digits is 5040, while the sum is 32.
The square root of 2125217129 is about 46100.0773209764. The cubic root of 2125217129 is about 1285.6845820574.
The spelling of 2125217129 in words is "two billion, one hundred twenty-five million, two hundred seventeen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •