Base | Representation |
---|---|
bin | 100101001000101… |
… | …111011000100111 |
3 | 1121102101010111102 |
4 | 211020233120213 |
5 | 2234000020411 |
6 | 141454030315 |
7 | 21303552101 |
oct | 4510573047 |
9 | 1542333442 |
10 | 623048231 |
11 | 29a7703a3 |
12 | 1547a839b |
13 | 9c1085c0 |
14 | 5ca66571 |
15 | 39a71d3b |
hex | 2522f627 |
623048231 has 16 divisors (see below), whose sum is σ = 685075104. Its totient is φ = 563082624.
The previous prime is 623048191. The next prime is 623048347. The reversal of 623048231 is 132840326.
623048231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-623048231 is a prime.
It is a super-2 number, since 2×6230482312 = 776378196304458722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 623048194 and 623048203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (623048131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 624425 + ... + 625421.
It is an arithmetic number, because the mean of its divisors is an integer number (42817194).
Almost surely, 2623048231 is an apocalyptic number.
623048231 is a deficient number, since it is larger than the sum of its proper divisors (62026873).
623048231 is a wasteful number, since it uses less digits than its factorization.
623048231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1970.
The product of its (nonzero) digits is 6912, while the sum is 29.
The square root of 623048231 is about 24960.9340971046. The cubic root of 623048231 is about 854.0970511492.
Adding to 623048231 its reverse (132840326), we get a palindrome (755888557).
The spelling of 623048231 in words is "six hundred twenty-three million, forty-eight thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •