Base | Representation |
---|---|
bin | 101100010100011001100… |
… | …001111010011100111001 |
3 | 101210011010022200212010111 |
4 | 230110121201322130321 |
5 | 344344301343232213 |
6 | 10251035551144321 |
7 | 433014551000326 |
oct | 54243141723471 |
9 | 11704108625114 |
10 | 3045560133433 |
11 | a74684330314 |
12 | 4122bbb150a1 |
13 | 19126c7bba3c |
14 | a7597ad1b4d |
15 | 5434e427a3d |
hex | 2c51987a739 |
3045560133433 has 16 divisors (see below), whose sum is σ = 3056991672384. Its totient is φ = 3034156769280.
The previous prime is 3045560133403. The next prime is 3045560133467. The reversal of 3045560133433 is 3343310655403.
3045560133433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3045560133433 - 229 = 3045023262521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3045560133403) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 993007966 + ... + 993011032.
It is an arithmetic number, because the mean of its divisors is an integer number (191061979524).
Almost surely, 23045560133433 is an apocalyptic number.
It is an amenable number.
3045560133433 is a deficient number, since it is larger than the sum of its proper divisors (11431538951).
3045560133433 is a wasteful number, since it uses less digits than its factorization.
3045560133433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6552.
The product of its (nonzero) digits is 583200, while the sum is 40.
Adding to 3045560133433 its reverse (3343310655403), we get a palindrome (6388870788836).
The spelling of 3045560133433 in words is "three trillion, forty-five billion, five hundred sixty million, one hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •