Base | Representation |
---|---|
bin | 1001001001101010001111… |
… | …01111110111111110001011 |
3 | 2122020202022012211200111112 |
4 | 10210311013233313332023 |
5 | 10114144130112422443 |
6 | 110444234121120535 |
7 | 4144563544435232 |
oct | 444650757677613 |
9 | 78222265750445 |
10 | 20123125514123 |
11 | 6459195820185 |
12 | 230bbb602914b |
13 | b2c7aab8a338 |
14 | 4d7d7071db19 |
15 | 24d6ae424b18 |
hex | 124d47bf7f8b |
20123125514123 has 4 divisors (see below), whose sum is σ = 20123516283168. Its totient is φ = 20122734745080.
The previous prime is 20123125514033. The next prime is 20123125514153. The reversal of 20123125514123 is 32141552132102.
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 20123125514123 - 212 = 20123125510027 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20123125514123.
It is not an unprimeable number, because it can be changed into a prime (20123125514153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 195307268 + ... + 195410273.
It is an arithmetic number, because the mean of its divisors is an integer number (5030879070792).
Almost surely, 220123125514123 is an apocalyptic number.
20123125514123 is a deficient number, since it is larger than the sum of its proper divisors (390769045).
20123125514123 is an equidigital number, since it uses as much as digits as its factorization.
20123125514123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390769044.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 20123125514123 its reverse (32141552132102), we get a palindrome (52264677646225).
The spelling of 20123125514123 in words is "twenty trillion, one hundred twenty-three billion, one hundred twenty-five million, five hundred fourteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •