Base | Representation |
---|---|
bin | 1001001110110011111000… |
… | …10000101110101000111111 |
3 | 2122212200002212221021100212 |
4 | 10213121330100232220333 |
5 | 10130044101122413043 |
6 | 111101423130543035 |
7 | 4163430256444436 |
oct | 447317420565077 |
9 | 78780085837325 |
10 | 20300100201023 |
11 | 65172513828a5 |
12 | 233a366597a7b |
13 | b433a2ac6796 |
14 | 50275c80411d |
15 | 2530bb239018 |
hex | 12767c42ea3f |
20300100201023 has 8 divisors (see below), whose sum is σ = 20325452211456. Its totient is φ = 20274748983000.
The previous prime is 20300100201001. The next prime is 20300100201079. The reversal of 20300100201023 is 32010200100302.
It is a happy number.
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 20300100201023 - 222 = 20300096006719 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20300100200989 and 20300100201007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20300100201523) 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, 64033340 + ... + 64349582.
It is an arithmetic number, because the mean of its divisors is an integer number (2540681526432).
Almost surely, 220300100201023 is an apocalyptic number.
20300100201023 is a deficient number, since it is larger than the sum of its proper divisors (25352010433).
20300100201023 is an equidigital number, since it uses as much as digits as its factorization.
20300100201023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396205.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20300100201023 its reverse (32010200100302), we get a palindrome (52310300301325).
The spelling of 20300100201023 in words is "twenty trillion, three hundred billion, one hundred million, two hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •