Base | Representation |
---|---|
bin | 101011101010001110010… |
… | …1010000100111110101101 |
3 | 210020122110122122210002200 |
4 | 1113110130222010332231 |
5 | 1241303111311330010 |
6 | 20432340433412113 |
7 | 1156345140220641 |
oct | 127243452047655 |
9 | 23218418583080 |
10 | 6000550105005 |
11 | 1a03901111495 |
12 | 80ab4410a039 |
13 | 346b07309011 |
14 | 16a5dcca8c21 |
15 | a614c3ebcc0 |
hex | 5751ca84fad |
6000550105005 has 48 divisors (see below), whose sum is σ = 10729962647040. Its totient is φ = 3099835557504.
The previous prime is 6000550104973. The next prime is 6000550105019. The reversal of 6000550105005 is 5005010550006.
6000550105005 is a `hidden beast` number, since 6 + 0 + 0 + 0 + 550 + 105 + 0 + 0 + 5 = 666.
It is not a de Polignac number, because 6000550105005 - 25 = 6000550104973 is a prime.
It is a super-3 number, since 3×60005501050053 (a number of 39 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6000550105005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7709275 + ... + 8451864.
It is an arithmetic number, because the mean of its divisors is an integer number (223540888480).
Almost surely, 26000550105005 is an apocalyptic number.
It is an amenable number.
6000550105005 is a deficient number, since it is larger than the sum of its proper divisors (4729412542035).
6000550105005 is a wasteful number, since it uses less digits than its factorization.
6000550105005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16161410 (or 16161407 counting only the distinct ones).
The product of its (nonzero) digits is 3750, while the sum is 27.
The spelling of 6000550105005 in words is "six trillion, five hundred fifty million, one hundred five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •