Base | Representation |
---|---|
bin | 111111011101100… |
… | …0100101111100001 |
3 | 12111101212111102022 |
4 | 1332323010233201 |
5 | 13330112241022 |
6 | 551144431225 |
7 | 103524505253 |
oct | 17673045741 |
9 | 5441774368 |
10 | 2129415137 |
11 | 9a2aaa123 |
12 | 4b5178515 |
13 | 27c219875 |
14 | 162b45cd3 |
15 | c6e27c42 |
hex | 7eec4be1 |
2129415137 has 4 divisors (see below), whose sum is σ = 2143517376. Its totient is φ = 2115312900.
The previous prime is 2129415133. The next prime is 2129415143. The reversal of 2129415137 is 7315149212.
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 a cyclic number.
It is not a de Polignac number, because 2129415137 - 22 = 2129415133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2129415097 and 2129415106.
It is not an unprimeable number, because it can be changed into a prime (2129415131) 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, 7050893 + ... + 7051194.
It is an arithmetic number, because the mean of its divisors is an integer number (535879344).
Almost surely, 22129415137 is an apocalyptic number.
It is an amenable number.
2129415137 is a deficient number, since it is larger than the sum of its proper divisors (14102239).
2129415137 is a wasteful number, since it uses less digits than its factorization.
2129415137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14102238.
The product of its digits is 15120, while the sum is 35.
The square root of 2129415137 is about 46145.5863219875. The cubic root of 2129415137 is about 1286.5305762783.
The spelling of 2129415137 in words is "two billion, one hundred twenty-nine million, four hundred fifteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •