Base | Representation |
---|---|
bin | 101100011110100110110… |
… | …101000110011010100010 |
3 | 101211012102011220120120220 |
4 | 230132212311012122202 |
5 | 400034223243411333 |
6 | 10300051325543510 |
7 | 433553301103650 |
oct | 54364665063242 |
9 | 11735364816526 |
10 | 3056520685218 |
11 | a79299275080 |
12 | 41445a714b96 |
13 | 1922c84b3a40 |
14 | a7d17653dd0 |
15 | 547917c38b3 |
hex | 2c7a6d466a2 |
3056520685218 has 128 divisors (see below), whose sum is σ = 8216018141184. Its totient is φ = 732091219200.
The previous prime is 3056520685217. The next prime is 3056520685223. The reversal of 3056520685218 is 8125860256503.
It is a happy number.
3056520685218 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (3056520685217) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5695180 + ... + 6208712.
It is an arithmetic number, because the mean of its divisors is an integer number (64187641728).
Almost surely, 23056520685218 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3056520685218, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4108009070592).
3056520685218 is an abundant number, since it is smaller than the sum of its proper divisors (5159497455966).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3056520685218 is a wasteful number, since it uses less digits than its factorization.
3056520685218 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514560.
The product of its (nonzero) digits is 3456000, while the sum is 51.
The spelling of 3056520685218 in words is "three trillion, fifty-six billion, five hundred twenty million, six hundred eighty-five thousand, two hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •