Base | Representation |
---|---|
bin | 100000100001101100011… |
… | …100001010001111110101 |
3 | 21220200110002111102202022 |
4 | 200201230130022033311 |
5 | 243110143243042003 |
6 | 4430500542522525 |
7 | 320326253124545 |
oct | 40415434121765 |
9 | 7820402442668 |
10 | 2235202315253 |
11 | 791a42487506 |
12 | 301244896445 |
13 | 132a1799228b |
14 | 7a281ca3325 |
15 | 3d221b47738 |
hex | 2086c70a3f5 |
2235202315253 has 2 divisors, whose sum is σ = 2235202315254. Its totient is φ = 2235202315252.
The previous prime is 2235202315237. The next prime is 2235202315259. The reversal of 2235202315253 is 3525132025322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2000193575524 + 235008739729 = 1414282^2 + 484777^2 .
It is a cyclic number.
It is not a de Polignac number, because 2235202315253 - 24 = 2235202315237 is a prime.
It is a super-2 number, since 2×22352023152532 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2235202315259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1117601157626 + 1117601157627.
It is an arithmetic number, because the mean of its divisors is an integer number (1117601157627).
Almost surely, 22235202315253 is an apocalyptic number.
It is an amenable number.
2235202315253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2235202315253 is an equidigital number, since it uses as much as digits as its factorization.
2235202315253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108000, while the sum is 35.
The spelling of 2235202315253 in words is "two trillion, two hundred thirty-five billion, two hundred two million, three hundred fifteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •