Base | Representation |
---|---|
bin | 1001001110110110001011… |
… | …01001000111100011111011 |
3 | 2122212210021200112011122101 |
4 | 10213123011221013203323 |
5 | 10130104111310100243 |
6 | 111102145230204231 |
7 | 4163502626046550 |
oct | 447330551074373 |
9 | 78783250464571 |
10 | 20301331331323 |
11 | 6517823311259 |
12 | 233a64a953677 |
13 | b4353ab9a553 |
14 | 502838118a27 |
15 | 25313e37354d |
hex | 1276c5a478fb |
20301331331323 has 8 divisors (see below), whose sum is σ = 23201642578400. Its totient is φ = 17401050348480.
The previous prime is 20301331331297. The next prime is 20301331331353. The reversal of 20301331331323 is 32313313310302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20301331331323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20301331331291 and 20301331331300.
It is not an unprimeable number, because it can be changed into a prime (20301331331353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6109938 + ... + 8828023.
It is an arithmetic number, because the mean of its divisors is an integer number (2900205322300).
Almost surely, 220301331331323 is an apocalyptic number.
20301331331323 is a deficient number, since it is larger than the sum of its proper divisors (2900311247077).
20301331331323 is a wasteful number, since it uses less digits than its factorization.
20301331331323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15132117.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 20301331331323 its reverse (32313313310302), we get a palindrome (52614644641625).
The spelling of 20301331331323 in words is "twenty trillion, three hundred one billion, three hundred thirty-one million, three hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •