Base | Representation |
---|---|
bin | 100001101111101001100… |
… | …011010010000110011101 |
3 | 22012200111112012121110202 |
4 | 201233221203102012131 |
5 | 300443104330304203 |
6 | 4533142433113245 |
7 | 326351434224356 |
oct | 41575143220635 |
9 | 8180445177422 |
10 | 2318905713053 |
11 | 814495904126 |
12 | 3155049b8825 |
13 | 13a89713a427 |
14 | 80342824d2d |
15 | 404c02ee388 |
hex | 21be98d219d |
2318905713053 has 2 divisors, whose sum is σ = 2318905713054. Its totient is φ = 2318905713052.
The previous prime is 2318905713041. The next prime is 2318905713119. The reversal of 2318905713053 is 3503175098132.
2318905713053 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., 2109181099204 + 209724613849 = 1452302^2 + 457957^2 .
It is a cyclic number.
It is not a de Polignac number, because 2318905713053 - 26 = 2318905712989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2318905712989 and 2318905713007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2318905113053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1159452856526 + 1159452856527.
It is an arithmetic number, because the mean of its divisors is an integer number (1159452856527).
Almost surely, 22318905713053 is an apocalyptic number.
It is an amenable number.
2318905713053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2318905713053 is an equidigital number, since it uses as much as digits as its factorization.
2318905713053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 47.
The spelling of 2318905713053 in words is "two trillion, three hundred eighteen billion, nine hundred five million, seven hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •