Base | Representation |
---|---|
bin | 1001001111101101011101… |
… | …10000110001000010001111 |
3 | 2122222121220012101010002112 |
4 | 10213312232300301002033 |
5 | 10131100403112400221 |
6 | 111123534343014235 |
7 | 4165603302405635 |
oct | 447665660610217 |
9 | 78877805333075 |
10 | 20331012231311 |
11 | 6529374415771 |
12 | 2344352a3a37b |
13 | b4628b107c72 |
14 | 50405201b355 |
15 | 253cc9e6915b |
hex | 127daec3108f |
20331012231311 has 4 divisors (see below), whose sum is σ = 20331260461224. Its totient is φ = 20330764001400.
The previous prime is 20331012231263. The next prime is 20331012231419. The reversal of 20331012231311 is 11313221013302.
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 20331012231311 - 222 = 20331008037007 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 (20331012230311) 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, 123992060 + ... + 124155921.
It is an arithmetic number, because the mean of its divisors is an integer number (5082815115306).
Almost surely, 220331012231311 is an apocalyptic number.
20331012231311 is a deficient number, since it is larger than the sum of its proper divisors (248229913).
20331012231311 is an equidigital number, since it uses as much as digits as its factorization.
20331012231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 248229912.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 20331012231311 its reverse (11313221013302), we get a palindrome (31644233244613).
The spelling of 20331012231311 in words is "twenty trillion, three hundred thirty-one billion, twelve million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •