Base | Representation |
---|---|
bin | 10000100111111000110… |
… | …110010010011001001001 |
3 | 11001012120201201101102001 |
4 | 100213320312102121021 |
5 | 122204003334022441 |
6 | 2232441230511001 |
7 | 145350165650020 |
oct | 20477066223111 |
9 | 4035521641361 |
10 | 1142341314121 |
11 | 400511988a87 |
12 | 165487965461 |
13 | 83950c396b7 |
14 | 3d40a9b98b7 |
15 | 1eaaccba731 |
hex | 109f8d92649 |
1142341314121 has 32 divisors (see below), whose sum is σ = 1412904960000. Its totient is φ = 901785120192.
The previous prime is 1142341314089. The next prime is 1142341314221. The reversal of 1142341314121 is 1214131432411.
It is a cyclic number.
It is not a de Polignac number, because 1142341314121 - 25 = 1142341314089 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1142341314121.
It is not an unprimeable number, because it can be changed into a prime (1142341314221) 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 31 ways as a sum of consecutive naturals, for example, 318160 + ... + 1544638.
It is an arithmetic number, because the mean of its divisors is an integer number (44153280000).
Almost surely, 21142341314121 is an apocalyptic number.
It is an amenable number.
1142341314121 is a deficient number, since it is larger than the sum of its proper divisors (270563645879).
1142341314121 is a wasteful number, since it uses less digits than its factorization.
1142341314121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226701.
The product of its digits is 2304, while the sum is 28.
Adding to 1142341314121 its reverse (1214131432411), we get a palindrome (2356472746532).
The spelling of 1142341314121 in words is "one trillion, one hundred forty-two billion, three hundred forty-one million, three hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •