Base | Representation |
---|---|
bin | 100111101001011… |
… | …1111000100001011 |
3 | 10102201100011010011 |
4 | 1033102333010023 |
5 | 10211034030341 |
6 | 340002332351 |
7 | 44653006030 |
oct | 11722770413 |
9 | 3381304104 |
10 | 1330376971 |
11 | 622a65a00 |
12 | 31165a0b7 |
13 | 182812711 |
14 | c898b387 |
15 | 7bbe0b81 |
hex | 4f4bf10b |
1330376971 has 48 divisors (see below), whose sum is σ = 1782208512. Its totient is φ = 969819840.
The previous prime is 1330376959. The next prime is 1330376977. The reversal of 1330376971 is 1796730331.
It is not a de Polignac number, because 1330376971 - 27 = 1330376843 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.
It is not an unprimeable number, because it can be changed into a prime (1330376977) 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 47 ways as a sum of consecutive naturals, for example, 914881 + ... + 916333.
It is an arithmetic number, because the mean of its divisors is an integer number (37129344).
Almost surely, 21330376971 is an apocalyptic number.
1330376971 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1330376971 is a deficient number, since it is larger than the sum of its proper divisors (451831541).
1330376971 is a wasteful number, since it uses less digits than its factorization.
1330376971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552 (or 1541 counting only the distinct ones).
The product of its (nonzero) digits is 71442, while the sum is 40.
The square root of 1330376971 is about 36474.3330439365. Note that the first 3 decimals coincide. The cubic root of 1330376971 is about 1099.8283398797.
The spelling of 1330376971 in words is "one billion, three hundred thirty million, three hundred seventy-six thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •