Base | Representation |
---|---|
bin | 10010110101110011… |
… | …101111111100101111 |
3 | 1221012212112010020020 |
4 | 102311303233330233 |
5 | 312412402023043 |
6 | 13143225253223 |
7 | 1314215051343 |
oct | 226563577457 |
9 | 57185463206 |
10 | 20230111023 |
11 | 8641408921 |
12 | 3b07034213 |
13 | 1ba52755c5 |
14 | d9caa5623 |
15 | 7d6071e83 |
hex | 4b5ceff2f |
20230111023 has 8 divisors (see below), whose sum is σ = 26980940928. Its totient is φ = 13483010904.
The previous prime is 20230111007. The next prime is 20230111039. The reversal of 20230111023 is 32011103202.
It is an interprime number because it is at equal distance from previous prime (20230111007) and next prime (20230111039).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20230111023 - 24 = 20230111007 is a prime.
It is a super-2 number, since 2×202301110232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20230110993 and 20230111011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20230111523) 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, 919765 + ... + 941502.
It is an arithmetic number, because the mean of its divisors is an integer number (3372617616).
Almost surely, 220230111023 is an apocalyptic number.
20230111023 is a deficient number, since it is larger than the sum of its proper divisors (6750829905).
20230111023 is a wasteful number, since it uses less digits than its factorization.
20230111023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1864893.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 20230111023 its reverse (32011103202), we get a palindrome (52241214225).
The spelling of 20230111023 in words is "twenty billion, two hundred thirty million, one hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •