Base | Representation |
---|---|
bin | 111100110011011… |
… | …101011110001111 |
3 | 2122002112121201012 |
4 | 330303131132033 |
5 | 4042122414043 |
6 | 245120435435 |
7 | 34164621413 |
oct | 7463353617 |
9 | 2562477635 |
10 | 1020123023 |
11 | 483918587 |
12 | 245778b7b |
13 | 1334645ba |
14 | 996a8d43 |
15 | 5e858a18 |
hex | 3ccdd78f |
1020123023 has 4 divisors (see below), whose sum is σ = 1020341088. Its totient is φ = 1019904960.
The previous prime is 1020123019. The next prime is 1020123067. The reversal of 1020123023 is 3203210201.
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: 3203210201 = 211 ⋅15181091.
It is a cyclic number.
It is not a de Polignac number, because 1020123023 - 22 = 1020123019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020122989 and 1020123007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020123523) 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, 101858 + ... + 111423.
It is an arithmetic number, because the mean of its divisors is an integer number (255085272).
Almost surely, 21020123023 is an apocalyptic number.
1020123023 is a deficient number, since it is larger than the sum of its proper divisors (218065).
1020123023 is an equidigital number, since it uses as much as digits as its factorization.
1020123023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 218064.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1020123023 is about 31939.3647870461. The cubic root of 1020123023 is about 1006.6631777847.
Adding to 1020123023 its reverse (3203210201), we get a palindrome (4223333224).
The spelling of 1020123023 in words is "one billion, twenty million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •