Base | Representation |
---|---|
bin | 100010000000000… |
… | …1001110101101111 |
3 | 2221111210021012220 |
4 | 1010000021311233 |
5 | 4314032002431 |
6 | 305113130423 |
7 | 40162261542 |
oct | 10400116557 |
9 | 2844707186 |
10 | 1140890991 |
11 | 536004319 |
12 | 27a0b9a13 |
13 | 152499c36 |
14 | ab744859 |
15 | 6a261b96 |
hex | 44009d6f |
1140890991 has 8 divisors (see below), whose sum is σ = 1546125744. Its totient is φ = 748125120.
The previous prime is 1140890987. The next prime is 1140891013. The reversal of 1140890991 is 1990980411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1140890991 - 22 = 1140890987 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1140890981) 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 7 ways as a sum of consecutive naturals, for example, 3117006 + ... + 3117371.
It is an arithmetic number, because the mean of its divisors is an integer number (193265718).
Almost surely, 21140890991 is an apocalyptic number.
1140890991 is a deficient number, since it is larger than the sum of its proper divisors (405234753).
1140890991 is an equidigital number, since it uses as much as digits as its factorization.
1140890991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6234441.
The product of its (nonzero) digits is 23328, while the sum is 42.
The square root of 1140890991 is about 33777.0778931511. The cubic root of 1140890991 is about 1044.9160104349.
The spelling of 1140890991 in words is "one billion, one hundred forty million, eight hundred ninety thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •