Base | Representation |
---|---|
bin | 10100100000100000… |
… | …11011100111111110 |
3 | 1001102022120010201022 |
4 | 22100100123213332 |
5 | 140022100124100 |
6 | 5020305544142 |
7 | 536561553122 |
oct | 122020334776 |
9 | 31368503638 |
10 | 11010161150 |
11 | 473aa4903a |
12 | 2173345052 |
13 | 1066074671 |
14 | 766397582 |
15 | 4468e9e85 |
hex | 29041b9fe |
11010161150 has 24 divisors (see below), whose sum is σ = 20597291064. Its totient is φ = 4378604000.
The previous prime is 11010161101. The next prime is 11010161167. The reversal of 11010161150 is 5116101011.
11010161150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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, 627776 + ... + 645075.
It is an arithmetic number, because the mean of its divisors is an integer number (858220461).
Almost surely, 211010161150 is an apocalyptic number.
11010161150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11010161150 is a deficient number, since it is larger than the sum of its proper divisors (9587129914).
11010161150 is a wasteful number, since it uses less digits than its factorization.
11010161150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273036 (or 1273031 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 17.
Adding to 11010161150 its reverse (5116101011), we get a palindrome (16126262161).
The spelling of 11010161150 in words is "eleven billion, ten million, one hundred sixty-one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •