Base | Representation |
---|---|
bin | 10111001111010000001010… |
… | …00111001010010100010001 |
3 | 20200221021011211102100220212 |
4 | 23213220011013022110101 |
5 | 23144222042300314103 |
6 | 300403430511013505 |
7 | 13522653310436612 |
oct | 1347500507122421 |
9 | 220837154370825 |
10 | 51101606651153 |
11 | 15312084813953 |
12 | 5893a0080a295 |
13 | 2268b263224b6 |
14 | c8948c217c09 |
15 | 5d940b6c57d8 |
hex | 2e7a051ca511 |
51101606651153 has 2 divisors, whose sum is σ = 51101606651154. Its totient is φ = 51101606651152.
The previous prime is 51101606651141. The next prime is 51101606651171. The reversal of 51101606651153 is 35115660610115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27181124456704 + 23920482194449 = 5213552^2 + 4890857^2 .
It is a cyclic number.
It is not a de Polignac number, because 51101606651153 - 224 = 51101589873937 is a prime.
It is a super-2 number, since 2×511016066511532 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51101606651153.
It is not a weakly prime, because it can be changed into another prime (51101606651653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25550803325576 + 25550803325577.
It is an arithmetic number, because the mean of its divisors is an integer number (25550803325577).
Almost surely, 251101606651153 is an apocalyptic number.
It is an amenable number.
51101606651153 is a deficient number, since it is larger than the sum of its proper divisors (1).
51101606651153 is an equidigital number, since it uses as much as digits as its factorization.
51101606651153 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 81000, while the sum is 41.
The spelling of 51101606651153 in words is "fifty-one trillion, one hundred one billion, six hundred six million, six hundred fifty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •