Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …10011000010110010111011 |
3 | 2122020122200112110110021022 |
4 | 10210310023103002302323 |
5 | 10114140040444321243 |
6 | 110443545331333055 |
7 | 4144526451111602 |
oct | 444641323026273 |
9 | 78218615413238 |
10 | 20122111323323 |
11 | 6458815294669 |
12 | 230b97245118b |
13 | b2c678a21c39 |
14 | 4d7cb5b5aa39 |
15 | 24d65038db68 |
hex | 124d0b4c2cbb |
20122111323323 has 4 divisors (see below), whose sum is σ = 20176058002848. Its totient is φ = 20068164643800.
The previous prime is 20122111323263. The next prime is 20122111323331. The reversal of 20122111323323 is 32332311122102.
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 20122111323323 - 214 = 20122111306939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122111323292 and 20122111323301.
It is not an unprimeable number, because it can be changed into a prime (20122111323383) 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, 26973339203 + ... + 26973339948.
It is an arithmetic number, because the mean of its divisors is an integer number (5044014500712).
Almost surely, 220122111323323 is an apocalyptic number.
20122111323323 is a deficient number, since it is larger than the sum of its proper divisors (53946679525).
20122111323323 is an equidigital number, since it uses as much as digits as its factorization.
20122111323323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53946679524.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 20122111323323 its reverse (32332311122102), we get a palindrome (52454422445425).
The spelling of 20122111323323 in words is "twenty trillion, one hundred twenty-two billion, one hundred eleven million, three hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •