Base | Representation |
---|---|
bin | 101100000101111101001… |
… | …101001011010110100101 |
3 | 101201200002120102222221111 |
4 | 230011331031023112211 |
5 | 344121021423100203 |
6 | 10235553101545021 |
7 | 431625345501064 |
oct | 54057515132645 |
9 | 11650076388844 |
10 | 3030052550053 |
11 | a69046742401 |
12 | 40b2b2575171 |
13 | 18c96aa63cb9 |
14 | a69263001db |
15 | 53c42c9d26d |
hex | 2c17d34b5a5 |
3030052550053 has 8 divisors (see below), whose sum is σ = 3106796166936. Its totient is φ = 2953444166400.
The previous prime is 3030052549999. The next prime is 3030052550059. The reversal of 3030052550053 is 3500552500303.
It can be written as a sum of positive squares in 4 ways, for example, as 170497145569 + 2859555404484 = 412913^2 + 1691022^2 .
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 3030052550053 - 29 = 3030052549541 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3030052549997 and 3030052550024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030052550059) 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, 33762928 + ... + 33852553.
It is an arithmetic number, because the mean of its divisors is an integer number (388349520867).
Almost surely, 23030052550053 is an apocalyptic number.
It is an amenable number.
3030052550053 is a deficient number, since it is larger than the sum of its proper divisors (76743616883).
3030052550053 is a wasteful number, since it uses less digits than its factorization.
3030052550053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67616615.
The product of its (nonzero) digits is 33750, while the sum is 31.
The spelling of 3030052550053 in words is "three trillion, thirty billion, fifty-two million, five hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •