Base | Representation |
---|---|
bin | 111011101011110… |
… | …100010101011101 |
3 | 2120210012110101220 |
4 | 323223310111131 |
5 | 4022320423201 |
6 | 243210123553 |
7 | 33546161211 |
oct | 7353642535 |
9 | 2523173356 |
10 | 1001342301 |
11 | 474260323 |
12 | 23b4205b9 |
13 | 12c5ba14b |
14 | 96dba941 |
15 | 5cd99036 |
hex | 3baf455d |
1001342301 has 8 divisors (see below), whose sum is σ = 1352023680. Its totient is φ = 659111232.
The previous prime is 1001342299. The next prime is 1001342311. The reversal of 1001342301 is 1032431001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1001342301 - 21 = 1001342299 is a prime.
It is a super-3 number, since 3×10013423013 (a number of 28 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001342311) 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, 2112300 + ... + 2112773.
It is an arithmetic number, because the mean of its divisors is an integer number (169002960).
Almost surely, 21001342301 is an apocalyptic number.
It is an amenable number.
1001342301 is a deficient number, since it is larger than the sum of its proper divisors (350681379).
1001342301 is an equidigital number, since it uses as much as digits as its factorization.
1001342301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4225155.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 1001342301 is about 31643.9931266583. The cubic root of 1001342301 is about 1000.4472336189.
Adding to 1001342301 its reverse (1032431001), we get a palindrome (2033773302).
The spelling of 1001342301 in words is "one billion, one million, three hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •