Base | Representation |
---|---|
bin | 1011100110111100… |
… | …01010010011001001 |
3 | 121002100002021202221 |
4 | 11303132022103021 |
5 | 100230424104031 |
6 | 2510230454041 |
7 | 310304165455 |
oct | 56336122311 |
9 | 17070067687 |
10 | 6232253641 |
11 | 2708a43449 |
12 | 125b204321 |
13 | 784236a63 |
14 | 4319c9665 |
15 | 267213a11 |
hex | 17378a4c9 |
6232253641 has 2 divisors, whose sum is σ = 6232253642. Its totient is φ = 6232253640.
The previous prime is 6232253611. The next prime is 6232253683. The reversal of 6232253641 is 1463522326.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5111678016 + 1120575625 = 71496^2 + 33475^2 .
It is a cyclic number.
It is not a de Polignac number, because 6232253641 - 29 = 6232253129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6232253597 and 6232253606.
It is not a weakly prime, because it can be changed into another prime (6232253611) 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 as a sum of consecutive naturals, namely, 3116126820 + 3116126821.
It is an arithmetic number, because the mean of its divisors is an integer number (3116126821).
Almost surely, 26232253641 is an apocalyptic number.
It is an amenable number.
6232253641 is a deficient number, since it is larger than the sum of its proper divisors (1).
6232253641 is an equidigital number, since it uses as much as digits as its factorization.
6232253641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 34.
The square root of 6232253641 is about 78944.6238891541. The cubic root of 6232253641 is about 1840.2706794014.
Adding to 6232253641 its reverse (1463522326), we get a palindrome (7695775967).
The spelling of 6232253641 in words is "six billion, two hundred thirty-two million, two hundred fifty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •