Base | Representation |
---|---|
bin | 111100110011000… |
… | …111000110111111 |
3 | 2122002100222001121 |
4 | 330303013012333 |
5 | 4042112001143 |
6 | 245114451411 |
7 | 34164060355 |
oct | 7463070677 |
9 | 2562328047 |
10 | 1020031423 |
11 | 483865784 |
12 | 245733b67 |
13 | 1334319b8 |
14 | 996837d5 |
15 | 5e83b7ed |
hex | 3ccc71bf |
1020031423 has 4 divisors (see below), whose sum is σ = 1043753128. Its totient is φ = 996309720.
The previous prime is 1020031417. The next prime is 1020031427. The reversal of 1020031423 is 3241300201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1020031423 - 25 = 1020031391 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020031397 and 1020031406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020031427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11860788 + ... + 11860873.
It is an arithmetic number, because the mean of its divisors is an integer number (260938282).
Almost surely, 21020031423 is an apocalyptic number.
1020031423 is a deficient number, since it is larger than the sum of its proper divisors (23721705).
1020031423 is an equidigital number, since it uses as much as digits as its factorization.
1020031423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23721704.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 1020031423 is about 31937.9307877013. The cubic root of 1020031423 is about 1006.6330464165.
Adding to 1020031423 its reverse (3241300201), we get a palindrome (4261331624).
The spelling of 1020031423 in words is "one billion, twenty million, thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •