Base | Representation |
---|---|
bin | 100111101010101… |
… | …1111011110010001 |
3 | 10102202120112101121 |
4 | 1033111133132101 |
5 | 10211221042001 |
6 | 340024402241 |
7 | 44661413413 |
oct | 11725373621 |
9 | 3382515347 |
10 | 1331034001 |
11 | 623374600 |
12 | 311916381 |
13 | 1829b27ab |
14 | c8abc9b3 |
15 | 7bcc06a1 |
hex | 4f55f791 |
1331034001 has 6 divisors (see below), whose sum is σ = 1463037506. Its totient is φ = 1210030800.
The previous prime is 1331033983. The next prime is 1331034007. The reversal of 1331034001 is 1004301331.
It can be written as a sum of positive squares in only one way, i.e., 1270209600 + 60824401 = 35640^2 + 7799^2 .
It is not a de Polignac number, because 1331034001 - 29 = 1331033489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331034007) 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 5 ways as a sum of consecutive naturals, for example, 5500020 + ... + 5500261.
Almost surely, 21331034001 is an apocalyptic number.
1331034001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1331034001 is a deficient number, since it is larger than the sum of its proper divisors (132003505).
1331034001 is a wasteful number, since it uses less digits than its factorization.
1331034001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11000303 (or 11000292 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1331034001 is about 36483.3386767165. The cubic root of 1331034001 is about 1100.0093665869.
Adding to 1331034001 its reverse (1004301331), we get a palindrome (2335335332).
The spelling of 1331034001 in words is "one billion, three hundred thirty-one million, thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •