Base | Representation |
---|---|
bin | 1001010001110000001111… |
… | …01011111100000000100101 |
3 | 2200020100010100110221012011 |
4 | 10220320013223330000211 |
5 | 10133223201221131001 |
6 | 111220105344354221 |
7 | 4203640224333052 |
oct | 450700753740045 |
9 | 80210110427164 |
10 | 20401223614501 |
11 | 6556123965094 |
12 | 2355a88615971 |
13 | b4ca9a293c12 |
14 | 5075d2b3a029 |
15 | 255a38dd1d51 |
hex | 128e07afc025 |
20401223614501 has 16 divisors (see below), whose sum is σ = 20894709287088. Its totient is φ = 19913538355200.
The previous prime is 20401223614417. The next prime is 20401223614511. The reversal of 20401223614501 is 10541632210402.
It can be written as a sum of positive squares in 8 ways, for example, as 278732258401 + 20122491356100 = 527951^2 + 4485810^2 .
It is a cyclic number.
It is not a de Polignac number, because 20401223614501 - 215 = 20401223581733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20401223614511) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 281511411 + ... + 281583871.
It is an arithmetic number, because the mean of its divisors is an integer number (1305919330443).
Almost surely, 220401223614501 is an apocalyptic number.
It is an amenable number.
20401223614501 is a deficient number, since it is larger than the sum of its proper divisors (493485672587).
20401223614501 is an equidigital number, since it uses as much as digits as its factorization.
20401223614501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 112392.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 20401223614501 its reverse (10541632210402), we get a palindrome (30942855824903).
The spelling of 20401223614501 in words is "twenty trillion, four hundred one billion, two hundred twenty-three million, six hundred fourteen thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.017 sec. • engine limits •