Base | Representation |
---|---|
bin | 110011100001101001100100… |
… | …1010000101000001010110101 |
3 | 2012102201221020202010010100101 |
4 | 1213003103021100220022311 |
5 | 433401121313403203412 |
6 | 4243532531201514101 |
7 | 164315314351053211 |
oct | 14703231120501265 |
9 | 2172657222103311 |
10 | 453225505522357 |
11 | 121458948337057 |
12 | 429ba180942931 |
13 | 165b7c9bc92b49 |
14 | 7dcc3353a5941 |
15 | 375e67ebd3457 |
hex | 19c34c94282b5 |
453225505522357 has 2 divisors, whose sum is σ = 453225505522358. Its totient is φ = 453225505522356.
The previous prime is 453225505522337. The next prime is 453225505522381. The reversal of 453225505522357 is 753225505522354.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 430577481630321 + 22648023892036 = 20750361^2 + 4758994^2 .
It is a cyclic number.
It is not a de Polignac number, because 453225505522357 - 231 = 453223358038709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 453225505522298 and 453225505522307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (453225505522337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 226612752761178 + 226612752761179.
It is an arithmetic number, because the mean of its divisors is an integer number (226612752761179).
Almost surely, 2453225505522357 is an apocalyptic number.
It is an amenable number.
453225505522357 is a deficient number, since it is larger than the sum of its proper divisors (1).
453225505522357 is an equidigital number, since it uses as much as digits as its factorization.
453225505522357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000000, while the sum is 55.
The spelling of 453225505522357 in words is "four hundred fifty-three trillion, two hundred twenty-five billion, five hundred five million, five hundred twenty-two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •