Base | Representation |
---|---|
bin | 10101101110000101… |
… | …11010000010101110 |
3 | 1010002200002110211202 |
4 | 22313002322002232 |
5 | 142340144132100 |
6 | 5205034045502 |
7 | 561653150105 |
oct | 126702720256 |
9 | 33080073752 |
10 | 11660927150 |
11 | 4a44320184 |
12 | 2315279892 |
13 | 113ab361c2 |
14 | 7c899703c |
15 | 483ae47d5 |
hex | 2b70ba0ae |
11660927150 has 12 divisors (see below), whose sum is σ = 21689324592. Its totient is φ = 4664370840.
The previous prime is 11660927111. The next prime is 11660927153. The reversal of 11660927150 is 5172906611.
11660927150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11660927153) 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 5 ways as a sum of consecutive naturals, for example, 116609222 + ... + 116609321.
It is an arithmetic number, because the mean of its divisors is an integer number (1807443716).
Almost surely, 211660927150 is an apocalyptic number.
11660927150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11660927150 is a deficient number, since it is larger than the sum of its proper divisors (10028397442).
11660927150 is a wasteful number, since it uses less digits than its factorization.
11660927150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 233218555 (or 233218550 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 38.
The spelling of 11660927150 in words is "eleven billion, six hundred sixty million, nine hundred twenty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •