Base | Representation |
---|---|
bin | 111111010011110… |
… | …1110100011010001 |
3 | 12111001022211110002 |
4 | 1332213232203101 |
5 | 13322312443010 |
6 | 550444015345 |
7 | 103433423204 |
oct | 17647564321 |
9 | 5431284402 |
10 | 2124343505 |
11 | 9a0155799 |
12 | 4b3531555 |
13 | 27b1622bb |
14 | 1621c593b |
15 | c67751a5 |
hex | 7e9ee8d1 |
2124343505 has 4 divisors (see below), whose sum is σ = 2549212212. Its totient is φ = 1699474800.
The previous prime is 2124343499. The next prime is 2124343513. The reversal of 2124343505 is 5053434212.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1335463936 + 788879569 = 36544^2 + 28087^2 .
It is not a de Polignac number, because 2124343505 - 222 = 2120149201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
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, 212434346 + ... + 212434355.
It is an arithmetic number, because the mean of its divisors is an integer number (637303053).
Almost surely, 22124343505 is an apocalyptic number.
It is an amenable number.
2124343505 is a deficient number, since it is larger than the sum of its proper divisors (424868707).
2124343505 is an equidigital number, since it uses as much as digits as its factorization.
2124343505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424868706.
The product of its (nonzero) digits is 14400, while the sum is 29.
The square root of 2124343505 is about 46090.6010483699. The cubic root of 2124343505 is about 1285.5083869079.
Adding to 2124343505 its reverse (5053434212), we get a palindrome (7177777717).
The spelling of 2124343505 in words is "two billion, one hundred twenty-four million, three hundred forty-three thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •