Base | Representation |
---|---|
bin | 10011110110111011… |
… | …01111000010100010 |
3 | 1000112000011112020100 |
4 | 21323131233002202 |
5 | 133313244431020 |
6 | 4521525123230 |
7 | 525124533015 |
oct | 117335570242 |
9 | 30460145210 |
10 | 10661327010 |
11 | 458104a864 |
12 | 2096559516 |
13 | 100ba09029 |
14 | 731d1137c |
15 | 425e91a90 |
hex | 27b76f0a2 |
10661327010 has 24 divisors (see below), whose sum is σ = 27719450460. Its totient is φ = 2843020512.
The previous prime is 10661326981. The next prime is 10661327023. The reversal of 10661327010 is 1072316601.
10661327010 is a `hidden beast` number, since 10 + 6 + 613 + 27 + 0 + 10 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 10660769001 + 558009 = 103251^2 + 747^2 .
It is a super-2 number, since 2×106613270102 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59229505 + ... + 59229684.
Almost surely, 210661327010 is an apocalyptic number.
10661327010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10661327010 is an abundant number, since it is smaller than the sum of its proper divisors (17058123450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10661327010 is a wasteful number, since it uses less digits than its factorization.
10661327010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118459202 (or 118459199 counting only the distinct ones).
The product of its (nonzero) digits is 1512, while the sum is 27.
The spelling of 10661327010 in words is "ten billion, six hundred sixty-one million, three hundred twenty-seven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •