Base | Representation |
---|---|
bin | 10000010111001101110… |
… | …111001001101011101001 |
3 | 10222111101011201011102102 |
4 | 100113031313021223221 |
5 | 121410323201013423 |
6 | 2220321040543145 |
7 | 144144451301654 |
oct | 20271567115351 |
9 | 3874334634372 |
10 | 1124440251113 |
11 | 3a3966231433 |
12 | 161b10921ab5 |
13 | 8205a369b1a |
14 | 3c5cd38489b |
15 | 1e3b1456c28 |
hex | 105cddc9ae9 |
1124440251113 has 4 divisors (see below), whose sum is σ = 1127662143300. Its totient is φ = 1121218358928.
The previous prime is 1124440251107. The next prime is 1124440251157. The reversal of 1124440251113 is 3111520444211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 882570060304 + 241870190809 = 939452^2 + 491803^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124440251113 - 26 = 1124440251049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1124440251413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1610945570 + ... + 1610946267.
It is an arithmetic number, because the mean of its divisors is an integer number (281915535825).
Almost surely, 21124440251113 is an apocalyptic number.
It is an amenable number.
1124440251113 is a deficient number, since it is larger than the sum of its proper divisors (3221892187).
1124440251113 is an equidigital number, since it uses as much as digits as its factorization.
1124440251113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3221892186.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 1124440251113 its reverse (3111520444211), we get a palindrome (4235960695324).
The spelling of 1124440251113 in words is "one trillion, one hundred twenty-four billion, four hundred forty million, two hundred fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.079 sec. • engine limits •