Base | Representation |
---|---|
bin | 111111100111100… |
… | …111111111000001 |
3 | 2202101102002200121 |
4 | 333213213333001 |
5 | 4141220231001 |
6 | 253525020241 |
7 | 35310225262 |
oct | 7747477701 |
9 | 2671362617 |
10 | 1067352001 |
11 | 4a85463a1 |
12 | 259554681 |
13 | 14018c641 |
14 | a1a80969 |
15 | 63a876a1 |
hex | 3f9e7fc1 |
1067352001 has 8 divisors (see below), whose sum is σ = 1088363304. Its totient is φ = 1046373120.
The previous prime is 1067351993. The next prime is 1067352019. The reversal of 1067352001 is 1002537601.
It can be written as a sum of positive squares in 4 ways, for example, as 70308225 + 997043776 = 8385^2 + 31576^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1067352001 - 23 = 1067351993 is a prime.
It is a super-2 number, since 2×10673520012 = 2278480588077408002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1067352031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64735 + ... + 79531.
It is an arithmetic number, because the mean of its divisors is an integer number (136045413).
Almost surely, 21067352001 is an apocalyptic number.
It is an amenable number.
1067352001 is a deficient number, since it is larger than the sum of its proper divisors (21011303).
1067352001 is a wasteful number, since it uses less digits than its factorization.
1067352001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16211.
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 1067352001 is about 32670.3535487451. The cubic root of 1067352001 is about 1021.9646872449.
Adding to 1067352001 its reverse (1002537601), we get a palindrome (2069889602).
The spelling of 1067352001 in words is "one billion, sixty-seven million, three hundred fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •