Base | Representation |
---|---|
bin | 101100000101111011110… |
… | …0001001001110011111101 |
3 | 210110100001202112102120002 |
4 | 1120023313201021303331 |
5 | 1243241443434110103 |
6 | 20515541311204045 |
7 | 1163552564525450 |
oct | 130136741116375 |
9 | 23410052472502 |
10 | 6060056550653 |
11 | 1a27067a34896 |
12 | 81a590816625 |
13 | 34c5cb729bc1 |
14 | 16d445da3497 |
15 | a798165b488 |
hex | 582f7849cfd |
6060056550653 has 8 divisors (see below), whose sum is σ = 7094700352320. Its totient is φ = 5067643108320.
The previous prime is 6060056550629. The next prime is 6060056550773. The reversal of 6060056550653 is 3560556500606.
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 6060056550653 - 230 = 6058982808829 is a prime.
It is a super-2 number, since 2×60600565506532 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6060056550598 and 6060056550607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6060056558653) 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, 10557589523 + ... + 10557590096.
It is an arithmetic number, because the mean of its divisors is an integer number (886837544040).
Almost surely, 26060056550653 is an apocalyptic number.
It is an amenable number.
6060056550653 is a deficient number, since it is larger than the sum of its proper divisors (1034643801667).
6060056550653 is a wasteful number, since it uses less digits than its factorization.
6060056550653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21115179667.
The product of its (nonzero) digits is 2430000, while the sum is 47.
The spelling of 6060056550653 in words is "six trillion, sixty billion, fifty-six million, five hundred fifty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •