Base | Representation |
---|---|
bin | 10000100110101011010… |
… | …010111111000001110011 |
3 | 11001002020001110122202112 |
4 | 100212223102333001303 |
5 | 122143322243323011 |
6 | 2232104151435535 |
7 | 145303016535416 |
oct | 20465322770163 |
9 | 4032201418675 |
10 | 1141040214131 |
11 | 3aaa044aa334 |
12 | 165184085bab |
13 | 837a4507b4c |
14 | 3d325c8db7d |
15 | 1ea3395e58b |
hex | 109ab4bf073 |
1141040214131 has 4 divisors (see below), whose sum is σ = 1141042934064. Its totient is φ = 1141037494200.
The previous prime is 1141040214089. The next prime is 1141040214239. The reversal of 1141040214131 is 1314120401411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1141040214131 - 214 = 1141040197747 is a prime.
It is a super-2 number, since 2×11410402141312 (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 = 1141040214097 and 1141040214106.
It is not an unprimeable number, because it can be changed into a prime (1141040214031) 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, 582575 + ... + 1619096.
It is an arithmetic number, because the mean of its divisors is an integer number (285260733516).
Almost surely, 21141040214131 is an apocalyptic number.
1141040214131 is a deficient number, since it is larger than the sum of its proper divisors (2719933).
1141040214131 is an equidigital number, since it uses as much as digits as its factorization.
1141040214131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2719932.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 1141040214131 its reverse (1314120401411), we get a palindrome (2455160615542).
The spelling of 1141040214131 in words is "one trillion, one hundred forty-one billion, forty million, two hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •