Base | Representation |
---|---|
bin | 110010101001101000011… |
… | …110001010010000011001 |
3 | 110022202020022102121022112 |
4 | 302221220132022100121 |
5 | 424011411104342203 |
6 | 11223000043402105 |
7 | 506320254640022 |
oct | 62515036122031 |
9 | 13282208377275 |
10 | 3480676246553 |
11 | 1122168000200 |
12 | 4826b3523335 |
13 | 1c32c341672c |
14 | c0673987c49 |
15 | 60818b8a6d8 |
hex | 32a6878a419 |
3480676246553 has 6 divisors (see below), whose sum is σ = 3825867279402. Its totient is φ = 3164251133120.
The previous prime is 3480676246493. The next prime is 3480676246561. The reversal of 3480676246553 is 3556426760843.
It can be written as a sum of positive squares in only one way, i.e., 3479519430409 + 1156816144 = 1865347^2 + 34012^2 .
It is a de Polignac number, because none of the positive numbers 2k-3480676246553 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3480676246492 and 3480676246501.
It is not an unprimeable number, because it can be changed into a prime (3480676246583) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14382959576 + ... + 14382959817.
It is an arithmetic number, because the mean of its divisors is an integer number (637644546567).
Almost surely, 23480676246553 is an apocalyptic number.
It is an amenable number.
3480676246553 is a deficient number, since it is larger than the sum of its proper divisors (345191032849).
3480676246553 is a wasteful number, since it uses less digits than its factorization.
3480676246553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28765919415 (or 28765919404 counting only the distinct ones).
The product of its (nonzero) digits is 87091200, while the sum is 59.
The spelling of 3480676246553 in words is "three trillion, four hundred eighty billion, six hundred seventy-six million, two hundred forty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •