Base | Representation |
---|---|
bin | 1000101100101001011111100… |
… | …1110110010001100110001001 |
3 | 2222021001120122100220000101112 |
4 | 2023022113321312101212021 |
5 | 1120210141114024330204 |
6 | 10005411523114500105 |
7 | 242626345425015404 |
oct | 21312277166214611 |
9 | 2867046570800345 |
10 | 612041326401929 |
11 | 1680192a5962226 |
12 | 58789861a34635 |
13 | 20368331ccc078 |
14 | ab1cd5b64cd3b |
15 | 4ab58ed27d26e |
hex | 22ca5f9d91989 |
612041326401929 has 2 divisors, whose sum is σ = 612041326401930. Its totient is φ = 612041326401928.
The previous prime is 612041326401917. The next prime is 612041326401937. The reversal of 612041326401929 is 929104623140216.
612041326401929 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 575613184963600 + 36428141438329 = 23991940^2 + 6035573^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-612041326401929 is a prime.
It is not a weakly prime, because it can be changed into another prime (612041326401229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306020663200964 + 306020663200965.
It is an arithmetic number, because the mean of its divisors is an integer number (306020663200965).
Almost surely, 2612041326401929 is an apocalyptic number.
It is an amenable number.
612041326401929 is a deficient number, since it is larger than the sum of its proper divisors (1).
612041326401929 is an equidigital number, since it uses as much as digits as its factorization.
612041326401929 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1119744, while the sum is 50.
The spelling of 612041326401929 in words is "six hundred twelve trillion, forty-one billion, three hundred twenty-six million, four hundred one thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •