Base | Representation |
---|---|
bin | 1101100100000110110… |
… | …0001000100010001001 |
3 | 211021111021122220121021 |
4 | 3121001230020202021 |
5 | 12304221230303223 |
6 | 255015212312441 |
7 | 22556465025535 |
oct | 3310154104211 |
9 | 737437586537 |
10 | 233030322313 |
11 | 8a9115a6238 |
12 | 391b5472721 |
13 | 18c894543a9 |
14 | b3c8b86bc5 |
15 | 60dd13165d |
hex | 3641b08889 |
233030322313 has 2 divisors, whose sum is σ = 233030322314. Its totient is φ = 233030322312.
The previous prime is 233030322307. The next prime is 233030322331. The reversal of 233030322313 is 313223030332.
Together with next prime (233030322331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 196578730384 + 36451591929 = 443372^2 + 190923^2 .
It is a cyclic number.
It is not a de Polignac number, because 233030322313 - 25 = 233030322281 is a prime.
It is a super-2 number, since 2×2330303223132 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (233030328313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116515161156 + 116515161157.
It is an arithmetic number, because the mean of its divisors is an integer number (116515161157).
Almost surely, 2233030322313 is an apocalyptic number.
It is an amenable number.
233030322313 is a deficient number, since it is larger than the sum of its proper divisors (1).
233030322313 is an equidigital number, since it uses as much as digits as its factorization.
233030322313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 233030322313 its reverse (313223030332), we get a palindrome (546253352645).
The spelling of 233030322313 in words is "two hundred thirty-three billion, thirty million, three hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •