Base | Representation |
---|---|
bin | 100110100001… |
… | …1111110000011 |
3 | 1102000100001001 |
4 | 1031003332003 |
5 | 20132420342 |
6 | 2000552431 |
7 | 333465025 |
oct | 115037603 |
9 | 42010031 |
10 | 20201347 |
11 | 10448631 |
12 | 6922717 |
13 | 4253c7a |
14 | 297c015 |
15 | 1b908b7 |
hex | 1343f83 |
20201347 has 8 divisors (see below), whose sum is σ = 20456576. Its totient is φ = 19948032.
The previous prime is 20201341. The next prime is 20201353. The reversal of 20201347 is 74310202.
It is an interprime number because it is at equal distance from previous prime (20201341) and next prime (20201353).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20201347 is a prime.
It is a super-2 number, since 2×202013472 = 816188841228818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20201341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34723 + ... + 35299.
It is an arithmetic number, because the mean of its divisors is an integer number (2557072).
Almost surely, 220201347 is an apocalyptic number.
20201347 is a deficient number, since it is larger than the sum of its proper divisors (255229).
20201347 is a wasteful number, since it uses less digits than its factorization.
20201347 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957.
The product of its (nonzero) digits is 336, while the sum is 19.
The square root of 20201347 is about 4494.5908601340. The cubic root of 20201347 is about 272.3496215997.
Adding to 20201347 its reverse (74310202), we get a palindrome (94511549).
The spelling of 20201347 in words is "twenty million, two hundred one thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •