Base | Representation |
---|---|
bin | 10100111100101110… |
… | …00010101110111111 |
3 | 1002000210210101012210 |
4 | 22132113002232333 |
5 | 141013133301411 |
6 | 5100001231503 |
7 | 545464004106 |
oct | 123627025677 |
9 | 32023711183 |
10 | 11246775231 |
11 | 485156976a |
12 | 221a632593 |
13 | 10a30ab2b3 |
14 | 78998b03d |
15 | 45c587ca6 |
hex | 29e5c2bbf |
11246775231 has 32 divisors (see below), whose sum is σ = 16126064640. Its totient is φ = 6958886400.
The previous prime is 11246775193. The next prime is 11246775269. The reversal of 11246775231 is 13257764211.
11246775231 is a nontrivial binomial coefficient, being equal to C(149979, 2).
It is an interprime number because it is at equal distance from previous prime (11246775193) and next prime (11246775269).
It is not a de Polignac number, because 11246775231 - 27 = 11246775103 is a prime.
It is a super-2 number, since 2×112467752312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11246775231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11246771231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 199971 + ... + 249963.
It is an arithmetic number, because the mean of its divisors is an integer number (503939520).
Almost surely, 211246775231 is an apocalyptic number.
11246775231 is the 149978-th triangular number.
11246775231 is a deficient number, since it is larger than the sum of its proper divisors (4879289409).
11246775231 is a wasteful number, since it uses less digits than its factorization.
11246775231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50127.
The product of its digits is 70560, while the sum is 39.
The spelling of 11246775231 in words is "eleven billion, two hundred forty-six million, seven hundred seventy-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •