Base | Representation |
---|---|
bin | 11111000001111000010… |
… | …00001000101011001010 |
3 | 10202220221120100221012112 |
4 | 33200330020020223022 |
5 | 114431444111430200 |
6 | 2133442030542322 |
7 | 140012312020121 |
oct | 17407410105312 |
9 | 3686846327175 |
10 | 1066160655050 |
11 | 381179993307 |
12 | 1527670679a2 |
13 | 7970018143a |
14 | 398611a8ab8 |
15 | 1caeec88535 |
hex | f83c208aca |
1066160655050 has 24 divisors (see below), whose sum is σ = 2099709338796. Its totient is φ = 401378128640.
The previous prime is 1066160655019. The next prime is 1066160655059. The reversal of 1066160655050 is 505560616601.
It can be written as a sum of positive squares in 6 ways, for example, as 403846269121 + 662314385929 = 635489^2 + 813827^2 .
It is a super-2 number, since 2×10661606550502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1066160654989 and 1066160655007.
It is not an unprimeable number, because it can be changed into a prime (1066160655059) 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 11 ways as a sum of consecutive naturals, for example, 627152477 + ... + 627154176.
Almost surely, 21066160655050 is an apocalyptic number.
1066160655050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1066160655050 is a deficient number, since it is larger than the sum of its proper divisors (1033548683746).
1066160655050 is a wasteful number, since it uses less digits than its factorization.
1066160655050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1254306682 (or 1254306677 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 1066160655050 in words is "one trillion, sixty-six billion, one hundred sixty million, six hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •