Base | Representation |
---|---|
bin | 110001001011111… |
… | …0111010011100101 |
3 | 11021000120011202021 |
4 | 1202113313103211 |
5 | 11340002014023 |
6 | 431434143141 |
7 | 55620235621 |
oct | 14227672345 |
9 | 4230504667 |
10 | 1650423013 |
11 | 777691268 |
12 | 3a0881ab1 |
13 | 203c0b885 |
14 | 11929c181 |
15 | 99d5e35d |
hex | 625f74e5 |
1650423013 has 2 divisors, whose sum is σ = 1650423014. Its totient is φ = 1650423012.
The previous prime is 1650422957. The next prime is 1650423023. The reversal of 1650423013 is 3103240561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1611460449 + 38962564 = 40143^2 + 6242^2 .
It is an emirp because it is prime and its reverse (3103240561) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1650423013 is a prime.
It is a super-2 number, since 2×16504230132 = 5447792243679996338, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1650423023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 825211506 + 825211507.
It is an arithmetic number, because the mean of its divisors is an integer number (825211507).
Almost surely, 21650423013 is an apocalyptic number.
It is an amenable number.
1650423013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1650423013 is an equidigital number, since it uses as much as digits as its factorization.
1650423013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1650423013 is about 40625.3986195828. The cubic root of 1650423013 is about 1181.7667236521.
Adding to 1650423013 its reverse (3103240561), we get a palindrome (4753663574).
The spelling of 1650423013 in words is "one billion, six hundred fifty million, four hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •