Base | Representation |
---|---|
bin | 100001101111000011001… |
… | …100110100101001101101 |
3 | 22012121211200111101102022 |
4 | 201233003030310221231 |
5 | 300440300121303203 |
6 | 4532554530235525 |
7 | 326326462225442 |
oct | 41570314645155 |
9 | 8177750441368 |
10 | 2318262291053 |
11 | 814195698705 |
12 | 315365425ba5 |
13 | 13a7c3a4a557 |
14 | 802c11b79c9 |
15 | 40483aa5a38 |
hex | 21bc3334a6d |
2318262291053 has 2 divisors, whose sum is σ = 2318262291054. Its totient is φ = 2318262291052.
The previous prime is 2318262291041. The next prime is 2318262291073. The reversal of 2318262291053 is 3501922628132.
2318262291053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2193962327209 + 124299963844 = 1481203^2 + 352562^2 .
It is a cyclic number.
It is not a de Polignac number, because 2318262291053 - 218 = 2318262028909 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2318262290995 and 2318262291013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2318262291073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1159131145526 + 1159131145527.
It is an arithmetic number, because the mean of its divisors is an integer number (1159131145527).
Almost surely, 22318262291053 is an apocalyptic number.
It is an amenable number.
2318262291053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2318262291053 is an equidigital number, since it uses as much as digits as its factorization.
2318262291053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 44.
The spelling of 2318262291053 in words is "two trillion, three hundred eighteen billion, two hundred sixty-two million, two hundred ninety-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •