Base | Representation |
---|---|
bin | 10000010111000000011… |
… | …000000100110111101011 |
3 | 10222110210101222110210110 |
4 | 100113000120010313223 |
5 | 121404342241014011 |
6 | 2220242355345403 |
7 | 144136033225014 |
oct | 20270030046753 |
9 | 3873711873713 |
10 | 1124214001131 |
11 | 3a385a54a481 |
12 | 161a68bb2263 |
13 | 820225216b0 |
14 | 3c5ab2cc00b |
15 | 1e39b664ba6 |
hex | 105c0604deb |
1124214001131 has 32 divisors (see below), whose sum is σ = 1701428016960. Its totient is φ = 655364795904.
The previous prime is 1124214001121. The next prime is 1124214001133. The reversal of 1124214001131 is 1311004124211.
It is not a de Polignac number, because 1124214001131 - 222 = 1124209806827 is a prime.
It is a super-2 number, since 2×11242140011312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1124214001098 and 1124214001107.
It is not an unprimeable number, because it can be changed into a prime (1124214001133) 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 31 ways as a sum of consecutive naturals, for example, 9317416 + ... + 9437301.
It is an arithmetic number, because the mean of its divisors is an integer number (53169625530).
Almost surely, 21124214001131 is an apocalyptic number.
1124214001131 is a deficient number, since it is larger than the sum of its proper divisors (577214015829).
1124214001131 is a wasteful number, since it uses less digits than its factorization.
1124214001131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18754815.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 1124214001131 its reverse (1311004124211), we get a palindrome (2435218125342).
The spelling of 1124214001131 in words is "one trillion, one hundred twenty-four billion, two hundred fourteen million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •