Base | Representation |
---|---|
bin | 1011010000000110… |
… | …01010010000111001 |
3 | 120120222111121101112 |
4 | 11220003022100321 |
5 | 44332400014413 |
6 | 2435223330105 |
7 | 302456322125 |
oct | 55003122071 |
9 | 16528447345 |
10 | 6040626233 |
11 | 261a859994 |
12 | 1206bb0935 |
13 | 753621665 |
14 | 414386585 |
15 | 2554b02a8 |
hex | 1680ca439 |
6040626233 has 2 divisors, whose sum is σ = 6040626234. Its totient is φ = 6040626232.
The previous prime is 6040626223. The next prime is 6040626247. The reversal of 6040626233 is 3326260406.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3717097024 + 2323529209 = 60968^2 + 48203^2 .
It is a cyclic number.
It is not a de Polignac number, because 6040626233 - 216 = 6040560697 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6040626233.
It is not a weakly prime, because it can be changed into another prime (6040626203) 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 as a sum of consecutive naturals, namely, 3020313116 + 3020313117.
It is an arithmetic number, because the mean of its divisors is an integer number (3020313117).
Almost surely, 26040626233 is an apocalyptic number.
It is an amenable number.
6040626233 is a deficient number, since it is larger than the sum of its proper divisors (1).
6040626233 is an equidigital number, since it uses as much as digits as its factorization.
6040626233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 32.
The square root of 6040626233 is about 77721.4657157210. The cubic root of 6040626233 is about 1821.2126355883.
Adding to 6040626233 its reverse (3326260406), we get a palindrome (9366886639).
The spelling of 6040626233 in words is "six billion, forty million, six hundred twenty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •