Base | Representation |
---|---|
bin | 100111101001001… |
… | …0000010000110101 |
3 | 10102200222102011002 |
4 | 1033102100100311 |
5 | 10211011412034 |
6 | 335554253045 |
7 | 44651250110 |
oct | 11722202065 |
9 | 3380872132 |
10 | 1330185269 |
11 | 622944976 |
12 | 311587185 |
13 | 18277639a |
14 | c893b577 |
15 | 7bba3e7e |
hex | 4f490435 |
1330185269 has 16 divisors (see below), whose sum is σ = 1607308800. Its totient is φ = 1075367664.
The previous prime is 1330185223. The next prime is 1330185271. The reversal of 1330185269 is 9625810331.
It is a happy number.
It is not a de Polignac number, because 1330185269 - 216 = 1330119733 is a prime.
It is a super-2 number, since 2×13301852692 = 3538785699729204722, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330155269) 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 15 ways as a sum of consecutive naturals, for example, 8162 + ... + 52220.
It is an arithmetic number, because the mean of its divisors is an integer number (100456800).
Almost surely, 21330185269 is an apocalyptic number.
1330185269 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1330185269 is a deficient number, since it is larger than the sum of its proper divisors (277123531).
1330185269 is a wasteful number, since it uses less digits than its factorization.
1330185269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44312.
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 1330185269 is about 36471.7050465152. The cubic root of 1330185269 is about 1099.7755103873.
The spelling of 1330185269 in words is "one billion, three hundred thirty million, one hundred eighty-five thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •