Base | Representation |
---|---|
bin | 111111010010010… |
… | …0001111001100011 |
3 | 12110222202020120122 |
4 | 1332210201321203 |
5 | 13322104132001 |
6 | 550414030455 |
7 | 103423332260 |
oct | 17644417143 |
9 | 5428666518 |
10 | 2123505251 |
11 | 99a732a1a |
12 | 4b31a842b |
13 | 27ac2a8aa |
14 | 162048267 |
15 | c665bb1b |
hex | 7e921e63 |
2123505251 has 16 divisors (see below), whose sum is σ = 2571791040. Its totient is φ = 1714513920.
The previous prime is 2123505233. The next prime is 2123505269. The reversal of 2123505251 is 1525053212.
It is an interprime number because it is at equal distance from previous prime (2123505233) and next prime (2123505269).
It is not a de Polignac number, because 2123505251 - 26 = 2123505187 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2123505251.
It is not an unprimeable number, because it can be changed into a prime (2123505211) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 119246 + ... + 135891.
It is an arithmetic number, because the mean of its divisors is an integer number (160736940).
Almost surely, 22123505251 is an apocalyptic number.
2123505251 is a deficient number, since it is larger than the sum of its proper divisors (448285789).
2123505251 is a wasteful number, since it uses less digits than its factorization.
2123505251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255214.
The product of its (nonzero) digits is 3000, while the sum is 26.
The square root of 2123505251 is about 46081.5066051448. The cubic root of 2123505251 is about 1285.3392798697.
Adding to 2123505251 its reverse (1525053212), we get a palindrome (3648558463).
The spelling of 2123505251 in words is "two billion, one hundred twenty-three million, five hundred five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •