Base | Representation |
---|---|
bin | 1001000110101101111011… |
… | …00100110100001000111111 |
3 | 2121220002100012211110210002 |
4 | 10203112331210310020333 |
5 | 10111020100404024411 |
6 | 110325553533504515 |
7 | 4134354253255151 |
oct | 443267544641077 |
9 | 77802305743702 |
10 | 20022023111231 |
11 | 641a324089509 |
12 | 22b449b04213b |
13 | b230b7b682bb |
14 | 4d30dd0d6ad1 |
15 | 24ac4352c33b |
hex | 1235bd93423f |
20022023111231 has 8 divisors (see below), whose sum is σ = 20585534486880. Its totient is φ = 19459689399648.
The previous prime is 20022023111227. The next prime is 20022023111249. The reversal of 20022023111231 is 13211132022002.
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 20022023111231 - 22 = 20022023111227 is a prime.
It is a super-2 number, since 2×200220231112312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022023111261) 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, 294381536 + ... + 294449541.
It is an arithmetic number, because the mean of its divisors is an integer number (2573191810860).
Almost surely, 220022023111231 is an apocalyptic number.
20022023111231 is a deficient number, since it is larger than the sum of its proper divisors (563511375649).
20022023111231 is an equidigital number, since it uses as much as digits as its factorization.
20022023111231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 588832033.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 20022023111231 its reverse (13211132022002), we get a palindrome (33233155133233).
The spelling of 20022023111231 in words is "twenty trillion, twenty-two billion, twenty-three million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •