Base | Representation |
---|---|
bin | 110000101100001101011… |
… | …010010010111010011101 |
3 | 102211212121210211002110202 |
4 | 300230031122102322131 |
5 | 414310104124124410 |
6 | 11041044441113245 |
7 | 463512053104265 |
oct | 60541532227235 |
9 | 12755553732422 |
10 | 3346004520605 |
11 | 108003a35a23a |
12 | 46058a188825 |
13 | 1b36b0700626 |
14 | b7d39c707a5 |
15 | 5c085b16ca5 |
hex | 30b0d692e9d |
3346004520605 has 16 divisors (see below), whose sum is σ = 4056697182384. Its totient is φ = 2649143777280.
The previous prime is 3346004520553. The next prime is 3346004520611. The reversal of 3346004520605 is 5060254006433.
It is a happy number.
3346004520605 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 82468331929 + 3263536188676 = 287173^2 + 1806526^2 .
It is not a de Polignac number, because 3346004520605 - 26 = 3346004520541 is a prime.
It is a super-2 number, since 2×33460045206052 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37694975 + ... + 37783635.
It is an arithmetic number, because the mean of its divisors is an integer number (253543573899).
Almost surely, 23346004520605 is an apocalyptic number.
It is an amenable number.
3346004520605 is a deficient number, since it is larger than the sum of its proper divisors (710692661779).
3346004520605 is an equidigital number, since it uses as much as digits as its factorization.
3346004520605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166576.
The product of its (nonzero) digits is 259200, while the sum is 38.
The spelling of 3346004520605 in words is "three trillion, three hundred forty-six billion, four million, five hundred twenty thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •