Base | Representation |
---|---|
bin | 100110100001… |
… | …1111001000111 |
3 | 1102000022121100 |
4 | 1031003321013 |
5 | 20132413111 |
6 | 2000551143 |
7 | 333464064 |
oct | 115037107 |
9 | 42008540 |
10 | 20201031 |
11 | 10448374 |
12 | 69224b3 |
13 | 4253a96 |
14 | 297bc6b |
15 | 1b90756 |
hex | 1343e47 |
20201031 has 6 divisors (see below), whose sum is σ = 29179280. Its totient is φ = 13467348.
The previous prime is 20201029. The next prime is 20201039. The reversal of 20201031 is 13010202.
It is a happy number.
It is not a de Polignac number, because 20201031 - 21 = 20201029 is a prime.
It is a super-2 number, since 2×202010312 = 816163306925922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 2244559 = 20201031 / (2 + 0 + 2 + 0 + 1 + 0 + 3 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201039) 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 5 ways as a sum of consecutive naturals, for example, 1122271 + ... + 1122288.
Almost surely, 220201031 is an apocalyptic number.
20201031 is a deficient number, since it is larger than the sum of its proper divisors (8978249).
20201031 is a wasteful number, since it uses less digits than its factorization.
20201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2244565 (or 2244562 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
The square root of 20201031 is about 4494.5557066300. Note that the first 3 decimals coincide. The cubic root of 20201031 is about 272.3482015140.
Adding to 20201031 its reverse (13010202), we get a palindrome (33211233).
The spelling of 20201031 in words is "twenty million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •