Base | Representation |
---|---|
bin | 1001001001101000001010… |
… | …10100110011001001011111 |
3 | 2122020122102112220121110101 |
4 | 10210310011110303021133 |
5 | 10114134334321321343 |
6 | 110443531351521531 |
7 | 4144524123312355 |
oct | 444640524631137 |
9 | 78218375817411 |
10 | 20122011120223 |
11 | 6458773774591 |
12 | 230b9449892a7 |
13 | b2c661039b6c |
14 | 4d7ca67157d5 |
15 | 24d646698e4d |
hex | 124d0553325f |
20122011120223 has 8 divisors (see below), whose sum is σ = 20131044834240. Its totient is φ = 20112978715680.
The previous prime is 20122011120221. The next prime is 20122011120227. The reversal of 20122011120223 is 32202111022102.
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 20122011120223 - 21 = 20122011120221 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 20122011120223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122011120221) 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, 31086586 + ... + 31727272.
It is an arithmetic number, because the mean of its divisors is an integer number (2516380604280).
Almost surely, 220122011120223 is an apocalyptic number.
20122011120223 is a deficient number, since it is larger than the sum of its proper divisors (9033714017).
20122011120223 is a wasteful number, since it uses less digits than its factorization.
20122011120223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654737.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20122011120223 its reverse (32202111022102), we get a palindrome (52324122142325).
The spelling of 20122011120223 in words is "twenty trillion, one hundred twenty-two billion, eleven million, one hundred twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •