Base | Representation |
---|---|
bin | 100010000000100… |
… | …0110101110101101 |
3 | 2221112020221100011 |
4 | 1010001012232231 |
5 | 4314112443042 |
6 | 305122333221 |
7 | 40164350635 |
oct | 10401065655 |
9 | 2845227304 |
10 | 1141140397 |
11 | 536164741 |
12 | 27a1ba211 |
13 | 152556607 |
14 | ab7ab6c5 |
15 | 6a2b0a17 |
hex | 44046bad |
1141140397 has 4 divisors (see below), whose sum is σ = 1142261280. Its totient is φ = 1140019516.
The previous prime is 1141140391. The next prime is 1141140409. The reversal of 1141140397 is 7930411411.
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, and also an emirpimes, since its reverse is a distinct semiprime: 7930411411 = 13 ⋅610031647.
It is a cyclic number.
It is not a de Polignac number, because 1141140397 - 215 = 1141107629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1141140391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 558913 + ... + 560950.
It is an arithmetic number, because the mean of its divisors is an integer number (285565320).
Almost surely, 21141140397 is an apocalyptic number.
It is an amenable number.
1141140397 is a deficient number, since it is larger than the sum of its proper divisors (1120883).
1141140397 is a wasteful number, since it uses less digits than its factorization.
1141140397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1120882.
The product of its (nonzero) digits is 3024, while the sum is 31.
The square root of 1141140397 is about 33780.7696330323. The cubic root of 1141140397 is about 1044.9921466409.
The spelling of 1141140397 in words is "one billion, one hundred forty-one million, one hundred forty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •