Base | Representation |
---|---|
bin | 10000010111000000010… |
… | …001001111111011010011 |
3 | 10222110210021121112202112 |
4 | 100113000101033323103 |
5 | 121404341311231121 |
6 | 2220242253135535 |
7 | 144136012062122 |
oct | 20270021177323 |
9 | 3873707545675 |
10 | 1124212211411 |
11 | 3a3859537873 |
12 | 161a6848a5ab |
13 | 82022045ba3 |
14 | 3c5aad83ab9 |
15 | 1e39b40e75b |
hex | 105c044fed3 |
1124212211411 has 4 divisors (see below), whose sum is σ = 1190342341512. Its totient is φ = 1058082081312.
The previous prime is 1124212211401. The next prime is 1124212211429. The reversal of 1124212211411 is 1141122124211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1124212211411 is a prime.
It is a super-2 number, since 2×11242122114112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1124212211401) 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 3 ways as a sum of consecutive naturals, for example, 33065065025 + ... + 33065065058.
It is an arithmetic number, because the mean of its divisors is an integer number (297585585378).
Almost surely, 21124212211411 is an apocalyptic number.
1124212211411 is a deficient number, since it is larger than the sum of its proper divisors (66130130101).
1124212211411 is an equidigital number, since it uses as much as digits as its factorization.
1124212211411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66130130100.
The product of its digits is 256, while the sum is 23.
Adding to 1124212211411 its reverse (1141122124211), we get a palindrome (2265334335622).
The spelling of 1124212211411 in words is "one trillion, one hundred twenty-four billion, two hundred twelve million, two hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •