Base | Representation |
---|---|
bin | 10011000101111011001… |
… | …10101001001100110001 |
3 | 2022201021212221101102101 |
4 | 21202331212221030301 |
5 | 41222010102144131 |
6 | 1221211500420401 |
7 | 65252455306006 |
oct | 11427546511461 |
9 | 2281255841371 |
10 | 656016053041 |
11 | 23323aa61308 |
12 | a7182547701 |
13 | 49b28bc6a1b |
14 | 23a739a18ad |
15 | 120e796bc61 |
hex | 98bd9a9331 |
656016053041 has 2 divisors, whose sum is σ = 656016053042. Its totient is φ = 656016053040.
The previous prime is 656016052999. The next prime is 656016053267. The reversal of 656016053041 is 140350610656.
656016053041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 651031128225 + 4984924816 = 806865^2 + 70604^2 .
It is a cyclic number.
It is not a de Polignac number, because 656016053041 - 225 = 655982498609 is a prime.
It is a super-3 number, since 3×6560160530413 (a number of 36 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (656016023041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 328008026520 + 328008026521.
It is an arithmetic number, because the mean of its divisors is an integer number (328008026521).
Almost surely, 2656016053041 is an apocalyptic number.
It is an amenable number.
656016053041 is a deficient number, since it is larger than the sum of its proper divisors (1).
656016053041 is an equidigital number, since it uses as much as digits as its factorization.
656016053041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 656016053041 its reverse (140350610656), we get a palindrome (796366663697).
The spelling of 656016053041 in words is "six hundred fifty-six billion, sixteen million, fifty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •