Base | Representation |
---|---|
bin | 100001100001010101010… |
… | …110100010001001011101 |
3 | 22011012211021110002100101 |
4 | 201201111112202021131 |
5 | 300220114304103203 |
6 | 4522121253301101 |
7 | 325265505453316 |
oct | 41412526421135 |
9 | 8135737402311 |
10 | 2303534441053 |
11 | 808a18158a4a |
12 | 312535034791 |
13 | 1392b76cab01 |
14 | 7d6c519760d |
15 | 3edc0aed41d |
hex | 218555a225d |
2303534441053 has 2 divisors, whose sum is σ = 2303534441054. Its totient is φ = 2303534441052.
The previous prime is 2303534441023. The next prime is 2303534441057. The reversal of 2303534441053 is 3501444353032.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2018141295769 + 285393145284 = 1420613^2 + 534222^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2303534441053 is a prime.
It is a super-2 number, since 2×23035344410532 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2303534441057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1151767220526 + 1151767220527.
It is an arithmetic number, because the mean of its divisors is an integer number (1151767220527).
Almost surely, 22303534441053 is an apocalyptic number.
It is an amenable number.
2303534441053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2303534441053 is an equidigital number, since it uses as much as digits as its factorization.
2303534441053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 259200, while the sum is 37.
Adding to 2303534441053 its reverse (3501444353032), we get a palindrome (5804978794085).
The spelling of 2303534441053 in words is "two trillion, three hundred three billion, five hundred thirty-four million, four hundred forty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •