Base | Representation |
---|---|
bin | 10000100101110100101… |
… | …000011110111100101001 |
3 | 11000222212010202120211020 |
4 | 100211310220132330221 |
5 | 122134433003244032 |
6 | 2231433150523053 |
7 | 145241212322163 |
oct | 20456450367451 |
9 | 4028763676736 |
10 | 1140123103017 |
11 | 3aa583850168 |
12 | 164b68b06489 |
13 | 836894ccc52 |
14 | 3d27a15b933 |
15 | 1e9cd1a2b2c |
hex | 10974a1ef29 |
1140123103017 has 4 divisors (see below), whose sum is σ = 1520164137360. Its totient is φ = 760082068676.
The previous prime is 1140123102971. The next prime is 1140123103039. The reversal of 1140123103017 is 7103013210411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1140123103017 - 27 = 1140123102889 is a prime.
It is a super-2 number, since 2×11401231030172 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1140123103087) 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, 190020517167 + ... + 190020517172.
It is an arithmetic number, because the mean of its divisors is an integer number (380041034340).
Almost surely, 21140123103017 is an apocalyptic number.
It is an amenable number.
1140123103017 is a deficient number, since it is larger than the sum of its proper divisors (380041034343).
1140123103017 is an equidigital number, since it uses as much as digits as its factorization.
1140123103017 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 380041034342.
The product of its (nonzero) digits is 504, while the sum is 24.
Adding to 1140123103017 its reverse (7103013210411), we get a palindrome (8243136313428).
The spelling of 1140123103017 in words is "one trillion, one hundred forty billion, one hundred twenty-three million, one hundred three thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •