Base | Representation |
---|---|
bin | 11001100000110111111111… |
… | …00110101110000101001001 |
3 | 21100122121012110011020021112 |
4 | 30300123333212232011021 |
5 | 24323211322144120044 |
6 | 315154203422420105 |
7 | 14550314643151013 |
oct | 1460337746560511 |
9 | 240577173136245 |
10 | 56105151160649 |
11 | 169710741988a8 |
12 | 6361679731635 |
13 | 253c901838356 |
14 | dbd70a6271b3 |
15 | 67465519709e |
hex | 3306ff9ae149 |
56105151160649 has 2 divisors, whose sum is σ = 56105151160650. Its totient is φ = 56105151160648.
The previous prime is 56105151160571. The next prime is 56105151160687. The reversal of 56105151160649 is 94606115150165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56044792498249 + 60358662400 = 7486307^2 + 245680^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56105151160649 is a prime.
It is a super-2 number, since 2×561051511606492 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56105151160597 and 56105151160606.
It is not a weakly prime, because it can be changed into another prime (56105151160249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28052575580324 + 28052575580325.
It is an arithmetic number, because the mean of its divisors is an integer number (28052575580325).
Almost surely, 256105151160649 is an apocalyptic number.
It is an amenable number.
56105151160649 is a deficient number, since it is larger than the sum of its proper divisors (1).
56105151160649 is an equidigital number, since it uses as much as digits as its factorization.
56105151160649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 50.
The spelling of 56105151160649 in words is "fifty-six trillion, one hundred five billion, one hundred fifty-one million, one hundred sixty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •