Base | Representation |
---|---|
bin | 10001110100000010110… |
… | …01010001010001010001 |
3 | 2011111211020210120022022 |
4 | 20322001121101101101 |
5 | 40011442344204413 |
6 | 1145101425221225 |
7 | 62135216132243 |
oct | 10720131212121 |
9 | 2144736716268 |
10 | 612056241233 |
11 | 216631879028 |
12 | 9a754491815 |
13 | 45941654168 |
14 | 218a3542093 |
15 | 10dc34ec608 |
hex | 8e81651451 |
612056241233 has 2 divisors, whose sum is σ = 612056241234. Its totient is φ = 612056241232.
The previous prime is 612056241217. The next prime is 612056241259. The reversal of 612056241233 is 332142650216.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 471245179729 + 140811061504 = 686473^2 + 375248^2 .
It is a cyclic number.
It is not a de Polignac number, because 612056241233 - 24 = 612056241217 is a prime.
It is a super-2 number, since 2×6120562412332 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 612056241193 and 612056241202.
It is not a weakly prime, because it can be changed into another prime (612056247233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 306028120616 + 306028120617.
It is an arithmetic number, because the mean of its divisors is an integer number (306028120617).
Almost surely, 2612056241233 is an apocalyptic number.
It is an amenable number.
612056241233 is a deficient number, since it is larger than the sum of its proper divisors (1).
612056241233 is an equidigital number, since it uses as much as digits as its factorization.
612056241233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 612056241233 its reverse (332142650216), we get a palindrome (944198891449).
The spelling of 612056241233 in words is "six hundred twelve billion, fifty-six million, two hundred forty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •