Base | Representation |
---|---|
bin | 110100101100001000… |
… | …100000000111011011 |
3 | 12102000210211211110022 |
4 | 310230020200013123 |
5 | 1411331200013201 |
6 | 41553514341055 |
7 | 4041660401012 |
oct | 645410400733 |
9 | 172023754408 |
10 | 56575001051 |
11 | 21aa2127718 |
12 | ab6aa2a78b |
13 | 5447cc07aa |
14 | 2a49a59a79 |
15 | 1711c0d41b |
hex | d2c2201db |
56575001051 has 2 divisors, whose sum is σ = 56575001052. Its totient is φ = 56575001050.
The previous prime is 56575001017. The next prime is 56575001053. The reversal of 56575001051 is 15010057565.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56575001051 - 226 = 56507892187 is a prime.
It is a super-2 number, since 2×565750010512 (a number of 22 digits) contains 22 as substring.
Together with 56575001053, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (56575001053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28287500525 + 28287500526.
It is an arithmetic number, because the mean of its divisors is an integer number (28287500526).
Almost surely, 256575001051 is an apocalyptic number.
56575001051 is a deficient number, since it is larger than the sum of its proper divisors (1).
56575001051 is an equidigital number, since it uses as much as digits as its factorization.
56575001051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26250, while the sum is 35.
The spelling of 56575001051 in words is "fifty-six billion, five hundred seventy-five million, one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •