Base | Representation |
---|---|
bin | 10010110000100001… |
… | …010110001110110101 |
3 | 1220222200121011222022 |
4 | 102300201112032311 |
5 | 312222144313023 |
6 | 13130340042525 |
7 | 1312060040516 |
oct | 226041261665 |
9 | 56880534868 |
10 | 20141401013 |
11 | 85a6328768 |
12 | 3aa1393445 |
13 | 1b8ca85886 |
14 | d90db2a0d |
15 | 7cd39c7c8 |
hex | 4b08563b5 |
20141401013 has 4 divisors (see below), whose sum is σ = 20149534860. Its totient is φ = 20133267168.
The previous prime is 20141400967. The next prime is 20141401037. The reversal of 20141401013 is 31010414102.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6425946244 + 13715454769 = 80162^2 + 117113^2 .
It is a cyclic number.
It is not a de Polignac number, because 20141401013 - 222 = 20137206709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20141400982 and 20141401000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20141401073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4063208 + ... + 4068161.
It is an arithmetic number, because the mean of its divisors is an integer number (5037383715).
Almost surely, 220141401013 is an apocalyptic number.
It is an amenable number.
20141401013 is a deficient number, since it is larger than the sum of its proper divisors (8133847).
20141401013 is an equidigital number, since it uses as much as digits as its factorization.
20141401013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8133846.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20141401013 its reverse (31010414102), we get a palindrome (51151815115).
The spelling of 20141401013 in words is "twenty billion, one hundred forty-one million, four hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •