Base | Representation |
---|---|
bin | 10000100110111100000… |
… | …011101101110100001101 |
3 | 11001002221122121121101002 |
4 | 100212330003231310031 |
5 | 122144411241033031 |
6 | 2232152115030045 |
7 | 145313003015603 |
oct | 20467403556415 |
9 | 4032848547332 |
10 | 1141321424141 |
11 | 40003920a5a8 |
12 | 16524229b325 |
13 | 8381a8571c2 |
14 | 3d351371873 |
15 | 1ea4d4aaccb |
hex | 109bc0edd0d |
1141321424141 has 8 divisors (see below), whose sum is σ = 1221085908000. Its totient is φ = 1063526433840.
The previous prime is 1141321424119. The next prime is 1141321424147. The reversal of 1141321424141 is 1414241231411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1141321424141 - 214 = 1141321407757 is a prime.
It is a super-2 number, since 2×11413214241412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141321424147) 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, 492372191 + ... + 492374508.
It is an arithmetic number, because the mean of its divisors is an integer number (152635738500).
Almost surely, 21141321424141 is an apocalyptic number.
It is an amenable number.
1141321424141 is a deficient number, since it is larger than the sum of its proper divisors (79764483859).
1141321424141 is an equidigital number, since it uses as much as digits as its factorization.
1141321424141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 984746779.
The product of its digits is 3072, while the sum is 29.
Adding to 1141321424141 its reverse (1414241231411), we get a palindrome (2555562655552).
The spelling of 1141321424141 in words is "one trillion, one hundred forty-one billion, three hundred twenty-one million, four hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •