Base | Representation |
---|---|
bin | 110000100010110010… |
… | …000000100001010111 |
3 | 11222112112212222020022 |
4 | 300202302000201113 |
5 | 1323222011022411 |
6 | 35540043455355 |
7 | 3523442253536 |
oct | 604262004127 |
9 | 158475788208 |
10 | 52123142231 |
11 | 20118178256 |
12 | a127b2755b |
13 | 4bb88a12c4 |
14 | 27466c231d |
15 | 1550e7dedb |
hex | c22c80857 |
52123142231 has 16 divisors (see below), whose sum is σ = 53144338464. Its totient is φ = 51111051264.
The previous prime is 52123142219. The next prime is 52123142293. The reversal of 52123142231 is 13224132125.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52123142231 is a prime.
It is a super-2 number, since 2×521231422312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52123142231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52123142131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11010341 + ... + 11015073.
It is an arithmetic number, because the mean of its divisors is an integer number (3321521154).
Almost surely, 252123142231 is an apocalyptic number.
52123142231 is a deficient number, since it is larger than the sum of its proper divisors (1021196233).
52123142231 is a wasteful number, since it uses less digits than its factorization.
52123142231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5650.
The product of its digits is 2880, while the sum is 26.
Adding to 52123142231 its reverse (13224132125), we get a palindrome (65347274356).
The spelling of 52123142231 in words is "fifty-two billion, one hundred twenty-three million, one hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •