Base | Representation |
---|---|
bin | 110000110100100111010… |
… | …110100101100010111111 |
3 | 102212201220210021020011121 |
4 | 300310213112211202333 |
5 | 414432100100044214 |
6 | 11045140201531411 |
7 | 464251522556161 |
oct | 60644726454277 |
9 | 12781823236147 |
10 | 3355029690559 |
11 | 1083950881a88 |
12 | 4622887a3b67 |
13 | 1b44bb454291 |
14 | b8554758931 |
15 | 5c413116424 |
hex | 30d275a58bf |
3355029690559 has 2 divisors, whose sum is σ = 3355029690560. Its totient is φ = 3355029690558.
The previous prime is 3355029690557. The next prime is 3355029690601. The reversal of 3355029690559 is 9550969205533.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3355029690559 - 21 = 3355029690557 is a prime.
It is a super-2 number, since 2×33550296905592 (a number of 26 digits) contains 22 as substring.
Together with 3355029690557, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 3355029690497 and 3355029690506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3355029690557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1677514845279 + 1677514845280.
It is an arithmetic number, because the mean of its divisors is an integer number (1677514845280).
Almost surely, 23355029690559 is an apocalyptic number.
3355029690559 is a deficient number, since it is larger than the sum of its proper divisors (1).
3355029690559 is an equidigital number, since it uses as much as digits as its factorization.
3355029690559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 49207500, while the sum is 61.
The spelling of 3355029690559 in words is "three trillion, three hundred fifty-five billion, twenty-nine million, six hundred ninety thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •