Base | Representation |
---|---|
bin | 10100110011000110… |
… | …11110100100100100 |
3 | 1001211012002010200101 |
4 | 22121203132210210 |
5 | 140332013231100 |
6 | 5044001153444 |
7 | 543464461654 |
oct | 123143364444 |
9 | 31735063611 |
10 | 11166148900 |
11 | 480aaaaa35 |
12 | 21b762b884 |
13 | 108c48baca |
14 | 77cda0364 |
15 | 45545d86a |
hex | 2998de924 |
11166148900 has 27 divisors (see below), whose sum is σ = 24232836369. Its totient is φ = 4466036880.
The previous prime is 11166148837. The next prime is 11166148909. The reversal of 11166148900 is 984166111.
The square root of 11166148900 is 105670.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 4019813604 + 7146335296 = 63402^2 + 84536^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11166148900.
It is not an unprimeable number, because it can be changed into a prime (11166148909) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1051417 + ... + 1061983.
Almost surely, 211166148900 is an apocalyptic number.
11166148900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11166148900 is the 105670-th square number.
It is an amenable number.
11166148900 is an abundant number, since it is smaller than the sum of its proper divisors (13066687469).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11166148900 is an frugal number, since it uses more digits than its factorization.
11166148900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21148 (or 10574 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 11166148900 in words is "eleven billion, one hundred sixty-six million, one hundred forty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •