Base | Representation |
---|---|
bin | 10000100101110100101… |
… | …000011110111101000001 |
3 | 11000222212010202120212010 |
4 | 100211310220132331001 |
5 | 122134433003244131 |
6 | 2231433150523133 |
7 | 145241212322226 |
oct | 20456450367501 |
9 | 4028763676763 |
10 | 1140123103041 |
11 | 3aa58385018a |
12 | 164b68b064a9 |
13 | 836894ccc70 |
14 | 3d27a15b94d |
15 | 1e9cd1a2b46 |
hex | 10974a1ef41 |
1140123103041 has 16 divisors (see below), whose sum is σ = 1641102552320. Its totient is φ = 699898769280.
The previous prime is 1140123103039. The next prime is 1140123103051. The reversal of 1140123103041 is 1403013210411.
It is not a de Polignac number, because 1140123103041 - 21 = 1140123103039 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1140123102999 and 1140123103017.
It is not an unprimeable number, because it can be changed into a prime (1140123103051) 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 15 ways as a sum of consecutive naturals, for example, 35722345 + ... + 35754246.
It is an arithmetic number, because the mean of its divisors is an integer number (102568909520).
Almost surely, 21140123103041 is an apocalyptic number.
It is an amenable number.
1140123103041 is a deficient number, since it is larger than the sum of its proper divisors (500979449279).
1140123103041 is a wasteful number, since it uses less digits than its factorization.
1140123103041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71477016.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 1140123103041 its reverse (1403013210411), we get a palindrome (2543136313452).
The spelling of 1140123103041 in words is "one trillion, one hundred forty billion, one hundred twenty-three million, one hundred three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •