Base | Representation |
---|---|
bin | 111110100101011… |
… | …100111000011111 |
3 | 2201011202210002221 |
4 | 332211130320133 |
5 | 4122300130043 |
6 | 252105130211 |
7 | 35006616064 |
oct | 7645347037 |
9 | 2634683087 |
10 | 1050005023 |
11 | 499778351 |
12 | 253789967 |
13 | 1396c7962 |
14 | 9d646c6b |
15 | 622ac8ed |
hex | 3e95ce1f |
1050005023 has 2 divisors, whose sum is σ = 1050005024. Its totient is φ = 1050005022.
The previous prime is 1050005009. The next prime is 1050005081. The reversal of 1050005023 is 3205000501.
It is a weak prime.
It is an emirp because it is prime and its reverse (3205000501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050005023 - 221 = 1047907871 is a prime.
It is a super-2 number, since 2×10500050232 = 2205021096650461058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1050004988 and 1050005006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050005083) 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 as a sum of consecutive naturals, namely, 525002511 + 525002512.
It is an arithmetic number, because the mean of its divisors is an integer number (525002512).
Almost surely, 21050005023 is an apocalyptic number.
1050005023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050005023 is an equidigital number, since it uses as much as digits as its factorization.
1050005023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 16.
The square root of 1050005023 is about 32403.7809985193. The cubic root of 1050005023 is about 1016.3979775611.
Adding to 1050005023 its reverse (3205000501), we get a palindrome (4255005524).
The spelling of 1050005023 in words is "one billion, fifty million, five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •