Base | Representation |
---|---|
bin | 110000110010011101101… |
… | …100001101110001110001 |
3 | 102212111221211101002210110 |
4 | 300302131230031301301 |
5 | 414412332321321221 |
6 | 11044115055251533 |
7 | 464140346451252 |
oct | 60623554156161 |
9 | 12774854332713 |
10 | 3352720104561 |
11 | 1082976103923 |
12 | 461943219ba9 |
13 | 1b4210b03b49 |
14 | b83b5b12b29 |
15 | 5c32a49e776 |
hex | 30c9db0dc71 |
3352720104561 has 8 divisors (see below), whose sum is σ = 4470773206720. Its totient is φ = 2234906869392.
The previous prime is 3352720104499. The next prime is 3352720104563. The reversal of 3352720104561 is 1654010272533.
3352720104561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3352720104561 - 223 = 3352711715953 is a prime.
It is a super-2 number, since 2×33527201045612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3352720104563) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59934130 + ... + 59990043.
It is an arithmetic number, because the mean of its divisors is an integer number (558846650840).
Almost surely, 23352720104561 is an apocalyptic number.
It is an amenable number.
3352720104561 is a deficient number, since it is larger than the sum of its proper divisors (1118053102159).
3352720104561 is a wasteful number, since it uses less digits than its factorization.
3352720104561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119933495.
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 3352720104561 in words is "three trillion, three hundred fifty-two billion, seven hundred twenty million, one hundred four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •