Base | Representation |
---|---|
bin | 111100110011000… |
… | …101000101010011 |
3 | 2122002100112200012 |
4 | 330303011011103 |
5 | 4042111214443 |
6 | 245114345135 |
7 | 34164024230 |
oct | 7463050523 |
9 | 2562315605 |
10 | 1020023123 |
11 | 48385a519 |
12 | 24572b1ab |
13 | 13342aca2 |
14 | 99680787 |
15 | 5e839118 |
hex | 3ccc5153 |
1020023123 has 8 divisors (see below), whose sum is σ = 1166283360. Its totient is φ = 873898560.
The previous prime is 1020023117. The next prime is 1020023131. The reversal of 1020023123 is 3213200201.
It is a happy number.
1020023123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020023123 - 212 = 1020019027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020023098 and 1020023107.
It is not an unprimeable number, because it can be changed into a prime (1020023183) 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, 17258 + ... + 48351.
It is an arithmetic number, because the mean of its divisors is an integer number (145785420).
Almost surely, 21020023123 is an apocalyptic number.
1020023123 is a deficient number, since it is larger than the sum of its proper divisors (146260237).
1020023123 is an equidigital number, since it uses as much as digits as its factorization.
1020023123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67837.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 1020023123 is about 31937.8008478981. The cubic root of 1020023123 is about 1006.6303160833.
Adding to 1020023123 its reverse (3213200201), we get a palindrome (4233223324).
The spelling of 1020023123 in words is "one billion, twenty million, twenty-three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •