Base | Representation |
---|---|
bin | 100001110100101011010… |
… | …000110011101001000101 |
3 | 22020012102200101222001121 |
4 | 201310223100303221011 |
5 | 301040133100231003 |
6 | 4535434202353541 |
7 | 326632253440333 |
oct | 41645320635105 |
9 | 8205380358047 |
10 | 2324303133253 |
11 | 816805584882 |
12 | 3165704bb8b1 |
13 | 13b2474162aa |
14 | 806d55b8b53 |
15 | 406d90a9cbd |
hex | 21d2b433a45 |
2324303133253 has 2 divisors, whose sum is σ = 2324303133254. Its totient is φ = 2324303133252.
The previous prime is 2324303133239. The next prime is 2324303133263. The reversal of 2324303133253 is 3523313034232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1640914884324 + 683388248929 = 1280982^2 + 826673^2 .
It is a cyclic number.
It is not a de Polignac number, because 2324303133253 - 217 = 2324303002181 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2324303133263) 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, 1162151566626 + 1162151566627.
It is an arithmetic number, because the mean of its divisors is an integer number (1162151566627).
Almost surely, 22324303133253 is an apocalyptic number.
It is an amenable number.
2324303133253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2324303133253 is an equidigital number, since it uses as much as digits as its factorization.
2324303133253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 34.
Adding to 2324303133253 its reverse (3523313034232), we get a palindrome (5847616167485).
The spelling of 2324303133253 in words is "two trillion, three hundred twenty-four billion, three hundred three million, one hundred thirty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •