Base | Representation |
---|---|
bin | 100010000010111… |
… | …0001101111011111 |
3 | 2221121120011101102 |
4 | 1010011301233133 |
5 | 4314421141101 |
6 | 305204503315 |
7 | 40210641434 |
oct | 10405615737 |
9 | 2847504342 |
10 | 1142365151 |
11 | 536920934 |
12 | 27a6aab3b |
13 | 152894c15 |
14 | aba09b8b |
15 | 6a45386b |
hex | 44171bdf |
1142365151 has 4 divisors (see below), whose sum is σ = 1142451912. Its totient is φ = 1142278392.
The previous prime is 1142365123. The next prime is 1142365157. The reversal of 1142365151 is 1515632411.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1142365151 - 26 = 1142365087 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 (1142365157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19100 + ... + 51473.
It is an arithmetic number, because the mean of its divisors is an integer number (285612978).
Almost surely, 21142365151 is an apocalyptic number.
1142365151 is a deficient number, since it is larger than the sum of its proper divisors (86761).
1142365151 is an equidigital number, since it uses as much as digits as its factorization.
1142365151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86760.
The product of its digits is 3600, while the sum is 29.
The square root of 1142365151 is about 33798.8927481360. The cubic root of 1142365151 is about 1045.3658665644.
Adding to 1142365151 its reverse (1515632411), we get a palindrome (2657997562).
The spelling of 1142365151 in words is "one billion, one hundred forty-two million, three hundred sixty-five thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •