Base | Representation |
---|---|
bin | 10100110011011101… |
… | …10111101001111111 |
3 | 1001211101200212011020 |
4 | 22121232313221333 |
5 | 140333244311411 |
6 | 5044145155223 |
7 | 543532040322 |
oct | 123156675177 |
9 | 31741625136 |
10 | 11169135231 |
11 | 481175a681 |
12 | 21b862bb13 |
13 | 108cc96177 |
14 | 77d53a7b9 |
15 | 45584d606 |
hex | 299bb7a7f |
11169135231 has 8 divisors (see below), whose sum is σ = 14969342640. Its totient is φ = 7407508992.
The previous prime is 11169135227. The next prime is 11169135301. The reversal of 11169135231 is 13253196111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11169135231 - 22 = 11169135227 is a prime.
It is a super-2 number, since 2×111691352312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11169135192 and 11169135201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11169115231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9644616 + ... + 9645773.
It is an arithmetic number, because the mean of its divisors is an integer number (1871167830).
Almost surely, 211169135231 is an apocalyptic number.
11169135231 is a deficient number, since it is larger than the sum of its proper divisors (3800207409).
11169135231 is a wasteful number, since it uses less digits than its factorization.
11169135231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19290585.
The product of its digits is 4860, while the sum is 33.
The spelling of 11169135231 in words is "eleven billion, one hundred sixty-nine million, one hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •