Base | Representation |
---|---|
bin | 10000010111000000011… |
… | …001001110111000110111 |
3 | 10222110210102112212200100 |
4 | 100113000121032320313 |
5 | 121404342330214221 |
6 | 2220242410045143 |
7 | 144136035626640 |
oct | 20270031167067 |
9 | 3873712485610 |
10 | 1124214304311 |
11 | 3a385a73723a |
12 | 161a691197b3 |
13 | 820225c96a7 |
14 | 3c5ab36a6c7 |
15 | 1e39b6c4926 |
hex | 105c064ee37 |
1124214304311 has 48 divisors (see below), whose sum is σ = 1860264065088. Its totient is φ = 640880640000.
The previous prime is 1124214304303. The next prime is 1124214304361. The reversal of 1124214304311 is 1134034124211.
It is a happy number.
1124214304311 is a `hidden beast` number, since 1 + 1 + 2 + 42 + 1 + 4 + 304 + 311 = 666.
It is not a de Polignac number, because 1124214304311 - 23 = 1124214304303 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1124214304361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 46828311 + ... + 46852311.
It is an arithmetic number, because the mean of its divisors is an integer number (38755501356).
Almost surely, 21124214304311 is an apocalyptic number.
1124214304311 is a deficient number, since it is larger than the sum of its proper divisors (736049760777).
1124214304311 is a wasteful number, since it uses less digits than its factorization.
1124214304311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25752 (or 25749 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 1124214304311 its reverse (1134034124211), we get a palindrome (2258248428522).
The spelling of 1124214304311 in words is "one trillion, one hundred twenty-four billion, two hundred fourteen million, three hundred four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •