Base | Representation |
---|---|
bin | 101100011101001100100… |
… | …101100010011010101101 |
3 | 101211001111122222221012002 |
4 | 230131030211202122231 |
5 | 400023123200444143 |
6 | 10255241203022045 |
7 | 433500625056053 |
oct | 54351445423255 |
9 | 11731448887162 |
10 | 3055006656173 |
11 | a786916826aa |
12 | 4140b766a925 |
13 | 19211691c074 |
14 | a7c1253c1d3 |
15 | 547039075b8 |
hex | 2c74c9626ad |
3055006656173 has 8 divisors (see below), whose sum is σ = 3118827110400. Its totient is φ = 2991763762960.
The previous prime is 3055006656127. The next prime is 3055006656193. The reversal of 3055006656173 is 3716566005503.
3055006656173 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 a cyclic number.
It is not a de Polignac number, because 3055006656173 - 212 = 3055006652077 is a prime.
It is a super-2 number, since 2×30550066561732 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3055006656193) 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, 144379565 + ... + 144400722.
It is an arithmetic number, because the mean of its divisors is an integer number (389853388800).
Almost surely, 23055006656173 is an apocalyptic number.
It is an amenable number.
3055006656173 is a deficient number, since it is larger than the sum of its proper divisors (63820454227).
3055006656173 is a wasteful number, since it uses less digits than its factorization.
3055006656173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288780507.
The product of its (nonzero) digits is 1701000, while the sum is 47.
The spelling of 3055006656173 in words is "three trillion, fifty-five billion, six million, six hundred fifty-six thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •