Base | Representation |
---|---|
bin | 111011100110101… |
… | …100111100110011 |
3 | 2120200200022221100 |
4 | 323212230330303 |
5 | 4022000020311 |
6 | 243121255443 |
7 | 33531604530 |
oct | 7346547463 |
9 | 2520608840 |
10 | 1000001331 |
11 | 47352488a |
12 | 23aa94583 |
13 | 12c23a984 |
14 | 96b4bd87 |
15 | 5cbd1a56 |
hex | 3b9acf33 |
1000001331 has 96 divisors (see below), whose sum is σ = 1816655360. Its totient is φ = 517321728.
The previous prime is 1000001329. The next prime is 1000001333. The reversal of 1000001331 is 1331000001.
It is an interprime number because it is at equal distance from previous prime (1000001329) and next prime (1000001333).
It is not a de Polignac number, because 1000001331 - 21 = 1000001329 is a prime.
It is a super-2 number, since 2×10000013312 = 2000005324003543122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1000001333) 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 95 ways as a sum of consecutive naturals, for example, 2967195 + ... + 2967531.
Almost surely, 21000001331 is an apocalyptic number.
1000001331 is a deficient number, since it is larger than the sum of its proper divisors (816654029).
1000001331 is a wasteful number, since it uses less digits than its factorization.
1000001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473 (or 470 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 9.
The square root of 1000001331 is about 31622.7976466346. The cubic root of 1000001331 is about 1000.0004436665. Note that the first 3 decimals are identical.
Adding to 1000001331 its reverse (1331000001), we get a palindrome (2331001332).
The spelling of 1000001331 in words is "one billion, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •