Base | Representation |
---|---|
bin | 1001001111011001100010… |
… | …00010110111101000001111 |
3 | 2122221121021120002121002012 |
4 | 10213230301002313220033 |
5 | 10130412000124104403 |
6 | 111115004543451435 |
7 | 4165044205404323 |
oct | 447546102675017 |
9 | 78847246077065 |
10 | 20320313113103 |
11 | 6524884003913 |
12 | 23422678b6b7b |
13 | b452746298a3 |
14 | 5037190ad983 |
15 | 2538a0a0eed8 |
hex | 127b310b7a0f |
20320313113103 has 8 divisors (see below), whose sum is σ = 20335369420800. Its totient is φ = 20305258935480.
The previous prime is 20320313113081. The next prime is 20320313113157. The reversal of 20320313113103 is 30131131302302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20320313113103 - 212 = 20320313109007 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 (20320313113403) 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 7 ways as a sum of consecutive naturals, for example, 18813926 + ... + 19864652.
It is an arithmetic number, because the mean of its divisors is an integer number (2541921177600).
Almost surely, 220320313113103 is an apocalyptic number.
20320313113103 is a deficient number, since it is larger than the sum of its proper divisors (15056307697).
20320313113103 is a wasteful number, since it uses less digits than its factorization.
20320313113103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065037.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 20320313113103 its reverse (30131131302302), we get a palindrome (50451444415405).
The spelling of 20320313113103 in words is "twenty trillion, three hundred twenty billion, three hundred thirteen million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •