Base | Representation |
---|---|
bin | 100010010001101… |
… | …1011111011110111 |
3 | 2222011012011200101 |
4 | 1010203123323313 |
5 | 4323413441101 |
6 | 310043254531 |
7 | 40334013166 |
oct | 10443337367 |
9 | 2864164611 |
10 | 1150140151 |
11 | 540251356 |
12 | 28121a447 |
13 | 154387b04 |
14 | aca713dd |
15 | 6ae8c401 |
hex | 448dbef7 |
1150140151 has 4 divisors (see below), whose sum is σ = 1217795472. Its totient is φ = 1082484832.
The previous prime is 1150140143. The next prime is 1150140161. The reversal of 1150140151 is 1510410511.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1510410511 = 83 ⋅18197717.
It is a cyclic number.
It is not a de Polignac number, because 1150140151 - 23 = 1150140143 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 (1150140161) 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 3 ways as a sum of consecutive naturals, for example, 33827635 + ... + 33827668.
It is an arithmetic number, because the mean of its divisors is an integer number (304448868).
Almost surely, 21150140151 is an apocalyptic number.
1150140151 is a deficient number, since it is larger than the sum of its proper divisors (67655321).
1150140151 is an equidigital number, since it uses as much as digits as its factorization.
1150140151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67655320.
The product of its (nonzero) digits is 100, while the sum is 19.
The square root of 1150140151 is about 33913.7162664312. The cubic root of 1150140151 is about 1047.7321122366.
Adding to 1150140151 its reverse (1510410511), we get a palindrome (2660550662).
The spelling of 1150140151 in words is "one billion, one hundred fifty million, one hundred forty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •