Base | Representation |
---|---|
bin | 1100101010111011… |
… | …1100001111011001 |
3 | 22210001011002120020 |
4 | 3022232330033121 |
5 | 23431213144001 |
6 | 1321301421053 |
7 | 150200412165 |
oct | 31256741731 |
9 | 8701132506 |
10 | 3401303001 |
11 | 1495a46318 |
12 | 7ab10a789 |
13 | 422890c35 |
14 | 243a29ca5 |
15 | 14d913736 |
hex | cabbc3d9 |
3401303001 has 8 divisors (see below), whose sum is σ = 4535897184. Its totient is φ = 2267122080.
The previous prime is 3401302991. The next prime is 3401303057. The reversal of 3401303001 is 1003031043.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3401303001 - 27 = 3401302873 is a prime.
It is a super-2 number, since 2×34013030012 = 23137724209223212002, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (3401303401) 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 7 ways as a sum of consecutive naturals, for example, 83571 + ... + 117416.
It is an arithmetic number, because the mean of its divisors is an integer number (566987148).
Almost surely, 23401303001 is an apocalyptic number.
It is an amenable number.
3401303001 is a deficient number, since it is larger than the sum of its proper divisors (1134594183).
3401303001 is a wasteful number, since it uses less digits than its factorization.
3401303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206631.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 3401303001 is about 58320.6910195687. The cubic root of 3401303001 is about 1503.8866614327.
Adding to 3401303001 its reverse (1003031043), we get a palindrome (4404334044).
The spelling of 3401303001 in words is "three billion, four hundred one million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •