Base | Representation |
---|---|
bin | 10000010111000110001… |
… | …110000100111000011011 |
3 | 10222111001020110112000002 |
4 | 100113012032010320123 |
5 | 121410042340334120 |
6 | 2220300221003215 |
7 | 144141333453326 |
oct | 20270616047033 |
9 | 3874036415002 |
10 | 1124312043035 |
11 | 3a38aa923845 |
12 | 161a959b350b |
13 | 8203992ab5c |
14 | 3c5ba32d7bd |
15 | 1e3a507e375 |
hex | 105c6384e1b |
1124312043035 has 8 divisors (see below), whose sum is σ = 1351215566736. Its totient is φ = 898088891040.
The previous prime is 1124312043031. The next prime is 1124312043059. The reversal of 1124312043035 is 5303402134211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1124312043035 - 22 = 1124312043031 is a prime.
It is a super-2 number, since 2×11243120430352 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1124312042989 and 1124312043007.
It is not an unprimeable number, because it can be changed into a prime (1124312043031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170089289 + ... + 170095898.
It is an arithmetic number, because the mean of its divisors is an integer number (168901945842).
Almost surely, 21124312043035 is an apocalyptic number.
1124312043035 is a deficient number, since it is larger than the sum of its proper divisors (226903523701).
1124312043035 is an equidigital number, since it uses as much as digits as its factorization.
1124312043035 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 340185853.
The product of its (nonzero) digits is 8640, while the sum is 29.
Adding to 1124312043035 its reverse (5303402134211), we get a palindrome (6427714177246).
The spelling of 1124312043035 in words is "one trillion, one hundred twenty-four billion, three hundred twelve million, forty-three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •