Base | Representation |
---|---|
bin | 10100100111001001… |
… | …00100000010010011 |
3 | 1001120012012100220012 |
4 | 22103210210002103 |
5 | 140130314121011 |
6 | 5030013505135 |
7 | 541135331333 |
oct | 122344440223 |
9 | 31505170805 |
10 | 11065770131 |
11 | 476937a979 |
12 | 2189aa21ab |
13 | 1074744aa0 |
14 | 76d9110c3 |
15 | 44b731a8b |
hex | 293924093 |
11065770131 has 8 divisors (see below), whose sum is σ = 11934595344. Its totient is φ = 10199460960.
The previous prime is 11065770119. The next prime is 11065770167. The reversal of 11065770131 is 13107756011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11065770131 - 218 = 11065507987 is a prime.
It is a super-2 number, since 2×110657701312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11065770631) 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 7 ways as a sum of consecutive naturals, for example, 619865 + ... + 637466.
It is an arithmetic number, because the mean of its divisors is an integer number (1491824418).
Almost surely, 211065770131 is an apocalyptic number.
11065770131 is a deficient number, since it is larger than the sum of its proper divisors (868825213).
11065770131 is a wasteful number, since it uses less digits than its factorization.
11065770131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1258021.
The product of its (nonzero) digits is 4410, while the sum is 32.
The spelling of 11065770131 in words is "eleven billion, sixty-five million, seven hundred seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •