Base | Representation |
---|---|
bin | 10010110000100000… |
… | …001101000010010001 |
3 | 1220222200000221201011 |
4 | 102300200031002101 |
5 | 312222110214301 |
6 | 13130325410521 |
7 | 1312054351444 |
oct | 226040150221 |
9 | 56880027634 |
10 | 20141101201 |
11 | 85a6143491 |
12 | 3aa1269a41 |
13 | 1b8c9ac280 |
14 | d90d3565b |
15 | 7cd33da51 |
hex | 4b080d091 |
20141101201 has 8 divisors (see below), whose sum is σ = 21710276840. Its totient is φ = 18574762752.
The previous prime is 20141101193. The next prime is 20141101231. The reversal of 20141101201 is 10210114102.
It can be written as a sum of positive squares in 4 ways, for example, as 9565035601 + 10576065600 = 97801^2 + 102840^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20141101201 - 23 = 20141101193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20141101231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 694536 + ... + 722953.
It is an arithmetic number, because the mean of its divisors is an integer number (2713784605).
Almost surely, 220141101201 is an apocalyptic number.
It is an amenable number.
20141101201 is a deficient number, since it is larger than the sum of its proper divisors (1569175639).
20141101201 is a wasteful number, since it uses less digits than its factorization.
20141101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1418595.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20141101201 its reverse (10210114102), we get a palindrome (30351215303).
The spelling of 20141101201 in words is "twenty billion, one hundred forty-one million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •