Base | Representation |
---|---|
bin | 1001000110110000001010… |
… | …00010001101111001001111 |
3 | 2121220012102202202101200102 |
4 | 10203120011002031321033 |
5 | 10111030024313014411 |
6 | 110330312522121315 |
7 | 4134426051541241 |
oct | 443300502157117 |
9 | 77805382671612 |
10 | 20023222001231 |
11 | 641a8898a7299 |
12 | 22b477465023b |
13 | b23249361477 |
14 | 4d31b4418091 |
15 | 24acb38e8d3b |
hex | 12360508de4f |
20023222001231 has 4 divisors (see below), whose sum is σ = 20023238401464. Its totient is φ = 20023205601000.
The previous prime is 20023222001221. The next prime is 20023222001257. The reversal of 20023222001231 is 13210022232002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20023222001231 is a prime.
It is a super-2 number, since 2×200232220012312 (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 (20023222001221) 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, 6207320 + ... + 8864381.
It is an arithmetic number, because the mean of its divisors is an integer number (5005809600366).
Almost surely, 220023222001231 is an apocalyptic number.
20023222001231 is a deficient number, since it is larger than the sum of its proper divisors (16400233).
20023222001231 is a wasteful number, since it uses less digits than its factorization.
20023222001231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16400232.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 20023222001231 its reverse (13210022232002), we get a palindrome (33233244233233).
The spelling of 20023222001231 in words is "twenty trillion, twenty-three billion, two hundred twenty-two million, one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •