Base | Representation |
---|---|
bin | 100111101001011… |
… | …0011100110000111 |
3 | 10102201020202200011 |
4 | 1033102303212013 |
5 | 10211031024431 |
6 | 340001331051 |
7 | 44652422044 |
oct | 11722634607 |
9 | 3381222604 |
10 | 1330329991 |
11 | 622a33681 |
12 | 311636a87 |
13 | 1827c7213 |
14 | c89781cb |
15 | 7bbd1cb1 |
hex | 4f4b3987 |
1330329991 has 4 divisors (see below), whose sum is σ = 1330494984. Its totient is φ = 1330165000.
The previous prime is 1330329983. The next prime is 1330329997. The reversal of 1330329991 is 1999230331.
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 1330329991 - 23 = 1330329983 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330329997) 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, 69745 + ... + 86746.
It is an arithmetic number, because the mean of its divisors is an integer number (332623746).
Almost surely, 21330329991 is an apocalyptic number.
1330329991 is a deficient number, since it is larger than the sum of its proper divisors (164993).
1330329991 is an equidigital number, since it uses as much as digits as its factorization.
1330329991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164992.
The product of its (nonzero) digits is 39366, while the sum is 40.
The square root of 1330329991 is about 36473.6890237333. The cubic root of 1330329991 is about 1099.8153935382.
The spelling of 1330329991 in words is "one billion, three hundred thirty million, three hundred twenty-nine thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •