Base | Representation |
---|---|
bin | 1001001001101000100100… |
… | …11000100110110111110011 |
3 | 2122020122222211012011000222 |
4 | 10210310102120212313303 |
5 | 10114140311414103243 |
6 | 110444005220003255 |
7 | 4144532423536115 |
oct | 444642230466763 |
9 | 78218884164028 |
10 | 20122230222323 |
11 | 64588764141a9 |
12 | 230b9a623052b |
13 | b2c697551988 |
14 | 4d7cc786b3b5 |
15 | 24d65aa28168 |
hex | 124d12626df3 |
20122230222323 has 8 divisors (see below), whose sum is σ = 20199874812768. Its totient is φ = 20044729286784.
The previous prime is 20122230222313. The next prime is 20122230222481. The reversal of 20122230222323 is 32322203222102.
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 20122230222323 - 218 = 20122229960179 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122230222292 and 20122230222301.
It is not an unprimeable number, because it can be changed into a prime (20122230222313) 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, 35633036 + ... + 36193337.
It is an arithmetic number, because the mean of its divisors is an integer number (2524984351596).
Almost surely, 220122230222323 is an apocalyptic number.
20122230222323 is a deficient number, since it is larger than the sum of its proper divisors (77644590445).
20122230222323 is an equidigital number, since it uses as much as digits as its factorization.
20122230222323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71827453.
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 20122230222323 its reverse (32322203222102), we get a palindrome (52444433444425).
The spelling of 20122230222323 in words is "twenty trillion, one hundred twenty-two billion, two hundred thirty million, two hundred twenty-two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •