Base | Representation |
---|---|
bin | 101110100100100010000… |
… | …000101001010111101001 |
3 | 102022221120220000011002112 |
4 | 232210202000221113221 |
5 | 404413224213332223 |
6 | 10450112434412105 |
7 | 450133641422444 |
oct | 56444200512751 |
9 | 12287526004075 |
10 | 3200321230313 |
11 | 10242809a1a79 |
12 | 4382b1131035 |
13 | 1a2a3457128c |
14 | b0c7991665b |
15 | 583aaebc778 |
hex | 2e9220295e9 |
3200321230313 has 2 divisors, whose sum is σ = 3200321230314. Its totient is φ = 3200321230312.
The previous prime is 3200321230273. The next prime is 3200321230333. The reversal of 3200321230313 is 3130321230023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3057052924249 + 143268306064 = 1748443^2 + 378508^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3200321230313 is a prime.
It is a super-3 number, since 3×32003212303133 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (3200321230333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1600160615156 + 1600160615157.
It is an arithmetic number, because the mean of its divisors is an integer number (1600160615157).
Almost surely, 23200321230313 is an apocalyptic number.
It is an amenable number.
3200321230313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3200321230313 is an equidigital number, since it uses as much as digits as its factorization.
3200321230313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 3200321230313 its reverse (3130321230023), we get a palindrome (6330642460336).
The spelling of 3200321230313 in words is "three trillion, two hundred billion, three hundred twenty-one million, two hundred thirty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •