Base | Representation |
---|---|
bin | 100110011000… |
… | …0110110001111 |
3 | 1101212100121011 |
4 | 1030300312033 |
5 | 20122414043 |
6 | 1555150051 |
7 | 333020464 |
oct | 114606617 |
9 | 41770534 |
10 | 20123023 |
11 | 103a47a8 |
12 | 68a5327 |
13 | 422741b |
14 | 295b66b |
15 | 1b7759d |
hex | 1330d8f |
20123023 has 4 divisors (see below), whose sum is σ = 20281600. Its totient is φ = 19964448.
The previous prime is 20123021. The next prime is 20123029. The reversal of 20123023 is 32032102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32032102 = 2 ⋅16016051.
It is a cyclic number.
It is not a de Polignac number, because 20123023 - 21 = 20123021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20122994 and 20123012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20123021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 79098 + ... + 79351.
It is an arithmetic number, because the mean of its divisors is an integer number (5070400).
Almost surely, 220123023 is an apocalyptic number.
20123023 is a deficient number, since it is larger than the sum of its proper divisors (158577).
20123023 is a wasteful number, since it uses less digits than its factorization.
20123023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158576.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 20123023 is about 4485.8692580145. The cubic root of 20123023 is about 271.9971840467.
Adding to 20123023 its reverse (32032102), we get a palindrome (52155125).
The spelling of 20123023 in words is "twenty million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •