Base | Representation |
---|---|
bin | 11000000111100011010000… |
… | …10001100101011010001111 |
3 | 20221210012012102100002200201 |
4 | 30003301220101211122033 |
5 | 23422420214414024101 |
6 | 304444223222034331 |
7 | 14112503442342403 |
oct | 1403615021453217 |
9 | 227705172302621 |
10 | 53036005611151 |
11 | 159984975813a2 |
12 | 5b46896b789a7 |
13 | 23793738c9a24 |
14 | d14d563b9103 |
15 | 61e8c5372e01 |
hex | 303c6846568f |
53036005611151 has 2 divisors, whose sum is σ = 53036005611152. Its totient is φ = 53036005611150.
The previous prime is 53036005611079. The next prime is 53036005611209. The reversal of 53036005611151 is 15111650063035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 53036005611151 - 29 = 53036005610639 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 53036005611151.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53036005611751) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26518002805575 + 26518002805576.
It is an arithmetic number, because the mean of its divisors is an integer number (26518002805576).
Almost surely, 253036005611151 is an apocalyptic number.
53036005611151 is a deficient number, since it is larger than the sum of its proper divisors (1).
53036005611151 is an equidigital number, since it uses as much as digits as its factorization.
53036005611151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 37.
Adding to 53036005611151 its reverse (15111650063035), we get a palindrome (68147655674186).
The spelling of 53036005611151 in words is "fifty-three trillion, thirty-six billion, five million, six hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •