Base | Representation |
---|---|
bin | 100110100001… |
… | …1111110100001 |
3 | 1102000100002011 |
4 | 1031003332201 |
5 | 20132421002 |
6 | 2000552521 |
7 | 333465100 |
oct | 115037641 |
9 | 42010064 |
10 | 20201377 |
11 | 10448659 |
12 | 6922741 |
13 | 4253ca1 |
14 | 297c037 |
15 | 1b908d7 |
hex | 1343fa1 |
20201377 has 6 divisors (see below), whose sum is σ = 23499618. Its totient is φ = 17315424.
The previous prime is 20201359. The next prime is 20201381. The reversal of 20201377 is 77310202.
It can be written as a sum of positive squares in only one way, i.e., 14130081 + 6071296 = 3759^2 + 2464^2 .
It is not a de Polignac number, because 20201377 - 27 = 20201249 is a prime.
It is a super-2 number, since 2×202013772 = 816191265392258, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20201387) 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, 206088 + ... + 206185.
It is an arithmetic number, because the mean of its divisors is an integer number (3916603).
Almost surely, 220201377 is an apocalyptic number.
It is an amenable number.
20201377 is a deficient number, since it is larger than the sum of its proper divisors (3298241).
20201377 is an equidigital number, since it uses as much as digits as its factorization.
20201377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 412287 (or 412280 counting only the distinct ones).
The product of its (nonzero) digits is 588, while the sum is 22.
The square root of 20201377 is about 4494.5941974777. The cubic root of 20201377 is about 272.3497564172.
Adding to 20201377 its reverse (77310202), we get a palindrome (97511579).
The spelling of 20201377 in words is "twenty million, two hundred one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •