Base | Representation |
---|---|
bin | 111100010001001… |
… | …101011001110111 |
3 | 2121110122110020022 |
4 | 330101031121313 |
5 | 4032323104221 |
6 | 244200155355 |
7 | 34025404412 |
oct | 7421153167 |
9 | 2543573208 |
10 | 1011144311 |
11 | 479845761 |
12 | 242768b5b |
13 | 13163c858 |
14 | 9840cb79 |
15 | 5db834ab |
hex | 3c44d677 |
1011144311 has 8 divisors (see below), whose sum is σ = 1016065344. Its totient is φ = 1006236000.
The previous prime is 1011144271. The next prime is 1011144313. The reversal of 1011144311 is 1134411101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1011144311 - 226 = 944035447 is a prime.
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 1011144311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011144313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 181061 + ... + 186561.
It is an arithmetic number, because the mean of its divisors is an integer number (127008168).
Almost surely, 21011144311 is an apocalyptic number.
1011144311 is a deficient number, since it is larger than the sum of its proper divisors (4921033).
1011144311 is an equidigital number, since it uses as much as digits as its factorization.
1011144311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6361.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 1011144311 is about 31798.4954203811. The cubic root of 1011144311 is about 1003.7010556218.
Adding to 1011144311 its reverse (1134411101), we get a palindrome (2145555412).
The spelling of 1011144311 in words is "one billion, eleven million, one hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •