Base | Representation |
---|---|
bin | 110100111111101001… |
… | …001111011000011001 |
3 | 12102212121210220021211 |
4 | 310333221033120121 |
5 | 1413014000202421 |
6 | 42050210503121 |
7 | 4053043666123 |
oct | 647751173031 |
9 | 172777726254 |
10 | 56902350361 |
11 | 2214a99103a |
12 | b040594aa1 |
13 | 549aa75bcc |
14 | 2a7b30c213 |
15 | 17308209e1 |
hex | d3fa4f619 |
56902350361 has 2 divisors, whose sum is σ = 56902350362. Its totient is φ = 56902350360.
The previous prime is 56902350311. The next prime is 56902350371. The reversal of 56902350361 is 16305320965.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56557876761 + 344473600 = 237819^2 + 18560^2 .
It is a cyclic number.
It is not a de Polignac number, because 56902350361 - 27 = 56902350233 is a prime.
It is not a weakly prime, because it can be changed into another prime (56902350301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28451175180 + 28451175181.
It is an arithmetic number, because the mean of its divisors is an integer number (28451175181).
Almost surely, 256902350361 is an apocalyptic number.
It is an amenable number.
56902350361 is a deficient number, since it is larger than the sum of its proper divisors (1).
56902350361 is an equidigital number, since it uses as much as digits as its factorization.
56902350361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 145800, while the sum is 40.
The spelling of 56902350361 in words is "fifty-six billion, nine hundred two million, three hundred fifty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •