Base | Representation |
---|---|
bin | 1001010010111000110111… |
… | …01100110110000100100111 |
3 | 2200101001202122221221022021 |
4 | 10221130123230312010213 |
5 | 10134343024302233221 |
6 | 111250034342044011 |
7 | 4206520363114453 |
oct | 451343354660447 |
9 | 80331678857267 |
10 | 20440214102311 |
11 | 6570711a92733 |
12 | 236154a419607 |
13 | b53672158793 |
14 | 509451201663 |
15 | 256a6be59041 |
hex | 12971bb36127 |
20440214102311 has 4 divisors (see below), whose sum is σ = 20440857494824. Its totient is φ = 20439570709800.
The previous prime is 20440214102291. The next prime is 20440214102317. The reversal of 20440214102311 is 11320141204402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20440214102311 - 29 = 20440214101799 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 (20440214102317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 321648600 + ... + 321712141.
It is an arithmetic number, because the mean of its divisors is an integer number (5110214373706).
Almost surely, 220440214102311 is an apocalyptic number.
20440214102311 is a deficient number, since it is larger than the sum of its proper divisors (643392513).
20440214102311 is an equidigital number, since it uses as much as digits as its factorization.
20440214102311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 643392512.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 20440214102311 its reverse (11320141204402), we get a palindrome (31760355306713).
The spelling of 20440214102311 in words is "twenty trillion, four hundred forty billion, two hundred fourteen million, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •