Base | Representation |
---|---|
bin | 100110010101… |
… | …1100100011001 |
3 | 1101211020221100 |
4 | 1030223210121 |
5 | 20121221101 |
6 | 1554502013 |
7 | 332600445 |
oct | 114534431 |
9 | 41736840 |
10 | 20101401 |
11 | 1038a531 |
12 | 6894909 |
13 | 421a628 |
14 | 2953825 |
15 | 1b70e86 |
hex | 132b919 |
20101401 has 6 divisors (see below), whose sum is σ = 29035370. Its totient is φ = 13400928.
The previous prime is 20101399. The next prime is 20101421. The reversal of 20101401 is 10410102.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10497600 + 9603801 = 3240^2 + 3099^2 .
It is not a de Polignac number, because 20101401 - 21 = 20101399 is a prime.
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: 2233489 = 20101401 / (2 + 0 + 1 + 0 + 1 + 4 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101421) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1116736 + ... + 1116753.
Almost surely, 220101401 is an apocalyptic number.
It is an amenable number.
20101401 is a deficient number, since it is larger than the sum of its proper divisors (8933969).
20101401 is a wasteful number, since it uses less digits than its factorization.
20101401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2233495 (or 2233492 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 20101401 is about 4483.4585980022. The cubic root of 20101401 is about 271.8997296570.
Adding to 20101401 its reverse (10410102), we get a palindrome (30511503).
It can be divided in two parts, 20101 and 401, that added together give a palindrome (20502).
The spelling of 20101401 in words is "twenty million, one hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •