Base | Representation |
---|---|
bin | 1001000110101111111100… |
… | …10111011000110000010111 |
3 | 2121220012010222012202002022 |
4 | 10203113332113120300113 |
5 | 10111024312142011411 |
6 | 110330253444003355 |
7 | 4134423222512354 |
oct | 443277627306027 |
9 | 77805128182068 |
10 | 20023110110231 |
11 | 641a831723998 |
12 | 22b474309055b |
13 | b2322c116487 |
14 | 4d31a360d62b |
15 | 24aca8b95edb |
hex | 1235fe5d8c17 |
20023110110231 has 4 divisors (see below), whose sum is σ = 20023194370872. Its totient is φ = 20023025849592.
The previous prime is 20023110110209. The next prime is 20023110110233. The reversal of 20023110110231 is 13201101132002.
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-20023110110231 is a prime.
It is a super-2 number, since 2×200231101102312 (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 (20023110110233) 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, 41772860 + ... + 42249473.
It is an arithmetic number, because the mean of its divisors is an integer number (5005798592718).
Almost surely, 220023110110231 is an apocalyptic number.
20023110110231 is a deficient number, since it is larger than the sum of its proper divisors (84260641).
20023110110231 is an equidigital number, since it uses as much as digits as its factorization.
20023110110231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84260640.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20023110110231 its reverse (13201101132002), we get a palindrome (33224211242233).
The spelling of 20023110110231 in words is "twenty trillion, twenty-three billion, one hundred ten million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •