Base | Representation |
---|---|
bin | 111101011011110… |
… | …100111101111111 |
3 | 2122211110020111010 |
4 | 331123310331333 |
5 | 4102330030043 |
6 | 250135330303 |
7 | 34353563625 |
oct | 7533647577 |
9 | 2584406433 |
10 | 1030705023 |
11 | 489895a37 |
12 | 249220993 |
13 | 1356cb03a |
14 | 9ac61515 |
15 | 60749133 |
hex | 3d6f4f7f |
1030705023 has 4 divisors (see below), whose sum is σ = 1374273368. Its totient is φ = 687136680.
The previous prime is 1030705009. The next prime is 1030705051. The reversal of 1030705023 is 3205070301.
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: 3205070301 = 3 ⋅1068356767.
It is not a de Polignac number, because 1030705023 - 214 = 1030688639 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030705523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 171784168 + ... + 171784173.
It is an arithmetic number, because the mean of its divisors is an integer number (343568342).
Almost surely, 21030705023 is an apocalyptic number.
1030705023 is a deficient number, since it is larger than the sum of its proper divisors (343568345).
1030705023 is an equidigital number, since it uses as much as digits as its factorization.
1030705023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343568344.
The product of its (nonzero) digits is 630, while the sum is 21.
The square root of 1030705023 is about 32104.5950449464. The cubic root of 1030705023 is about 1010.1320034638.
Adding to 1030705023 its reverse (3205070301), we get a palindrome (4235775324).
The spelling of 1030705023 in words is "one billion, thirty million, seven hundred five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •