Base | Representation |
---|---|
bin | 10100100000101000… |
… | …10111000010010011 |
3 | 1001102101111110022100 |
4 | 22100110113002103 |
5 | 140022331102211 |
6 | 5020344011443 |
7 | 536603402316 |
oct | 122024270223 |
9 | 31371443270 |
10 | 11011190931 |
11 | 47405917a4 |
12 | 2173760b83 |
13 | 10663452c0 |
14 | 76658497d |
15 | 446a50156 |
hex | 290517093 |
11011190931 has 24 divisors (see below), whose sum is σ = 17719163280. Its totient is φ = 6542456256.
The previous prime is 11011190891. The next prime is 11011190963. The reversal of 11011190931 is 13909111011.
It is not a de Polignac number, because 11011190931 - 218 = 11010928787 is a prime.
It is a super-2 number, since 2×110111909312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011190895 and 11011190904.
It is not an unprimeable number, because it can be changed into a prime (11011190231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1619241 + ... + 1626026.
It is an arithmetic number, because the mean of its divisors is an integer number (738298470).
Almost surely, 211011190931 is an apocalyptic number.
11011190931 is a deficient number, since it is larger than the sum of its proper divisors (6707972349).
11011190931 is a wasteful number, since it uses less digits than its factorization.
11011190931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3245315 (or 3245312 counting only the distinct ones).
The product of its (nonzero) digits is 243, while the sum is 27.
The spelling of 11011190931 in words is "eleven billion, eleven million, one hundred ninety thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •