Base | Representation |
---|---|
bin | 110000000110001010011… |
… | …100010011010000000001 |
3 | 102200222011202120201011002 |
4 | 300012022130103100001 |
5 | 413122423021302223 |
6 | 11010211025101345 |
7 | 460534521632222 |
oct | 60061234232001 |
9 | 12628152521132 |
10 | 3305152525313 |
11 | 1064786487561 |
12 | 454688a87855 |
13 | 1ac89cc91852 |
14 | b5d82481249 |
15 | 5ae94436e28 |
hex | 3018a713401 |
3305152525313 has 2 divisors, whose sum is σ = 3305152525314. Its totient is φ = 3305152525312.
The previous prime is 3305152525303. The next prime is 3305152525351. The reversal of 3305152525313 is 3135252515033.
It is an a-pointer prime, because the next prime (3305152525351) can be obtained adding 3305152525313 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1854409362289 + 1450743163024 = 1361767^2 + 1204468^2 .
It is a cyclic number.
It is not a de Polignac number, because 3305152525313 - 26 = 3305152525249 is a prime.
It is a super-2 number, since 2×33051525253132 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3305152525303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1652576262656 + 1652576262657.
It is an arithmetic number, because the mean of its divisors is an integer number (1652576262657).
Almost surely, 23305152525313 is an apocalyptic number.
It is an amenable number.
3305152525313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3305152525313 is an equidigital number, since it uses as much as digits as its factorization.
3305152525313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 202500, while the sum is 38.
The spelling of 3305152525313 in words is "three trillion, three hundred five billion, one hundred fifty-two million, five hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •