Base | Representation |
---|---|
bin | 101100001001000000010… |
… | …0011010001000101111011 |
3 | 210110222002022022100001020 |
4 | 1120102000203101011323 |
5 | 1243344000020110101 |
6 | 20522551503353523 |
7 | 1164205153563315 |
oct | 130220043210573 |
9 | 23428068270036 |
10 | 6066650550651 |
11 | 1a29941095669 |
12 | 81b910bb28a3 |
13 | 35010c8a0552 |
14 | 16d8ada367b5 |
15 | a7c1a4c9136 |
hex | 584808d117b |
6066650550651 has 8 divisors (see below), whose sum is σ = 8089174519104. Its totient is φ = 4044280141320.
The previous prime is 6066650550593. The next prime is 6066650550673. The reversal of 6066650550651 is 1560550566606.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6066650550651 - 210 = 6066650549627 is a prime.
It is a super-3 number, since 3×60666505506513 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6066650550594 and 6066650550603.
It is not an unprimeable number, because it can be changed into a prime (6066650550551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38297565 + ... + 38455646.
It is an arithmetic number, because the mean of its divisors is an integer number (1011146814888).
Almost surely, 26066650550651 is an apocalyptic number.
6066650550651 is a deficient number, since it is larger than the sum of its proper divisors (2022523968453).
6066650550651 is a wasteful number, since it uses less digits than its factorization.
6066650550651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76779561.
The product of its (nonzero) digits is 4860000, while the sum is 51.
The spelling of 6066650550651 in words is "six trillion, sixty-six billion, six hundred fifty million, five hundred fifty thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •