Base | Representation |
---|---|
bin | 110000111001101110101… |
… | …001001011010001011011 |
3 | 102220021002110121002022111 |
4 | 300321232221023101123 |
5 | 420024321300311212 |
6 | 11051445113333151 |
7 | 464534556520642 |
oct | 60715651132133 |
9 | 12807073532274 |
10 | 3360520713307 |
11 | 108620937470a |
12 | 46335b7071b7 |
13 | 1b4b84c43a74 |
14 | b8915b16359 |
15 | 5c635210ea7 |
hex | 30e6ea4b45b |
3360520713307 has 2 divisors, whose sum is σ = 3360520713308. Its totient is φ = 3360520713306.
The previous prime is 3360520713301. The next prime is 3360520713337. The reversal of 3360520713307 is 7033170250633.
3360520713307 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3360520713307 is a prime.
It is a super-3 number, since 3×33605207133073 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 3360520713307.
It is not a weakly prime, because it can be changed into another prime (3360520713301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1680260356653 + 1680260356654.
It is an arithmetic number, because the mean of its divisors is an integer number (1680260356654).
Almost surely, 23360520713307 is an apocalyptic number.
3360520713307 is a deficient number, since it is larger than the sum of its proper divisors (1).
3360520713307 is an equidigital number, since it uses as much as digits as its factorization.
3360520713307 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 238140, while the sum is 40.
The spelling of 3360520713307 in words is "three trillion, three hundred sixty billion, five hundred twenty million, seven hundred thirteen thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •