Base | Representation |
---|---|
bin | 101100010100011001100… |
… | …001111111010101100100 |
3 | 101210011010022201212120122 |
4 | 230110121201333111210 |
5 | 344344301344402234 |
6 | 10251035551421112 |
7 | 433014551112554 |
oct | 54243141772544 |
9 | 11704108655518 |
10 | 3045560153444 |
11 | a74684344356 |
12 | 4122bbb24798 |
13 | 19126c7c7b93 |
14 | a7597ad9164 |
15 | 5434e42d92e |
hex | 2c51987f564 |
3045560153444 has 12 divisors (see below), whose sum is σ = 5513514071100. Its totient is φ = 1470270418848.
The previous prime is 3045560153429. The next prime is 3045560153453. The reversal of 3045560153444 is 4443510655403.
3045560153444 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 2 ways, for example, as 2493083102500 + 552477050944 = 1578950^2 + 743288^2 .
It is a super-2 number, since 2×30455601534442 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3045560153395 and 3045560153404.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13127414339 + ... + 13127414570.
It is an arithmetic number, because the mean of its divisors is an integer number (459459505925).
Almost surely, 23045560153444 is an apocalyptic number.
It is an amenable number.
3045560153444 is a deficient number, since it is larger than the sum of its proper divisors (2467953917656).
3045560153444 is a wasteful number, since it uses less digits than its factorization.
3045560153444 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26254828942 (or 26254828940 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 44.
The spelling of 3045560153444 in words is "three trillion, forty-five billion, five hundred sixty million, one hundred fifty-three thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •