Base | Representation |
---|---|
bin | 1001001001101010001100… |
… | …01110100011101100110001 |
3 | 2122020202020102211120222121 |
4 | 10210311012032203230301 |
5 | 10114144102100044441 |
6 | 110444231410234241 |
7 | 4144563114544153 |
oct | 444650616435461 |
9 | 78222212746877 |
10 | 20123100003121 |
11 | 6459182386405 |
12 | 230bba9585981 |
13 | b2c7a57c767b |
14 | 4d7d6b19cad3 |
15 | 24d6ac085dd1 |
hex | 124d463a3b31 |
20123100003121 has 8 divisors (see below), whose sum is σ = 20148688465920. Its totient is φ = 20097512393808.
The previous prime is 20123100003119. The next prime is 20123100003157. The reversal of 20123100003121 is 12130000132102.
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 20123100003121 - 21 = 20123100003119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20123100003095 and 20123100003104.
It is not an unprimeable number, because it can be changed into a prime (20123109003121) 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, 56542710 + ... + 56897488.
It is an arithmetic number, because the mean of its divisors is an integer number (2518586058240).
Almost surely, 220123100003121 is an apocalyptic number.
It is an amenable number.
20123100003121 is a deficient number, since it is larger than the sum of its proper divisors (25588462799).
20123100003121 is an equidigital number, since it uses as much as digits as its factorization.
20123100003121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426743.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 20123100003121 its reverse (12130000132102), we get a palindrome (32253100135223).
The spelling of 20123100003121 in words is "twenty trillion, one hundred twenty-three billion, one hundred million, three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •