Base | Representation |
---|---|
bin | 110100001111111011… |
… | …000011110001101011 |
3 | 12100210211021102010012 |
4 | 310033323003301223 |
5 | 1404344014340201 |
6 | 41434530242135 |
7 | 4024152465314 |
oct | 641773036153 |
9 | 170724242105 |
10 | 56101715051 |
11 | 21879a56968 |
12 | aa5842634b |
13 | 53a0c2cac5 |
14 | 2a02c5960b |
15 | 16d53c05bb |
hex | d0fec3c6b |
56101715051 has 2 divisors, whose sum is σ = 56101715052. Its totient is φ = 56101715050.
The previous prime is 56101715041. The next prime is 56101715081. The reversal of 56101715051 is 15051710165.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 56101715051 - 26 = 56101714987 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56101714999 and 56101715017.
It is not a weakly prime, because it can be changed into another prime (56101715041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28050857525 + 28050857526.
It is an arithmetic number, because the mean of its divisors is an integer number (28050857526).
Almost surely, 256101715051 is an apocalyptic number.
56101715051 is a deficient number, since it is larger than the sum of its proper divisors (1).
56101715051 is an equidigital number, since it uses as much as digits as its factorization.
56101715051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 32.
The spelling of 56101715051 in words is "fifty-six billion, one hundred one million, seven hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •