Base | Representation |
---|---|
bin | 111011111001110… |
… | …1011000011011001 |
3 | 12012002020022211021 |
4 | 1313303223003121 |
5 | 13104032100033 |
6 | 531242002441 |
7 | 100545003403 |
oct | 16763530331 |
9 | 5162208737 |
10 | 2010034393 |
11 | 941680654 |
12 | 4811a6421 |
13 | 26057b783 |
14 | 150d4bb73 |
15 | bb6e5b2d |
hex | 77ceb0d9 |
2010034393 has 2 divisors, whose sum is σ = 2010034394. Its totient is φ = 2010034392.
The previous prime is 2010034373. The next prime is 2010034417. The reversal of 2010034393 is 3934300102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1038901824 + 971132569 = 32232^2 + 31163^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010034393 - 221 = 2007937241 is a prime.
It is a super-2 number, since 2×20100343932 = 8080476522085756898, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2010034303) 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, 1005017196 + 1005017197.
It is an arithmetic number, because the mean of its divisors is an integer number (1005017197).
Almost surely, 22010034393 is an apocalyptic number.
It is an amenable number.
2010034393 is a deficient number, since it is larger than the sum of its proper divisors (1).
2010034393 is an equidigital number, since it uses as much as digits as its factorization.
2010034393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
The square root of 2010034393 is about 44833.4071089851. The cubic root of 2010034393 is about 1262.0246262827.
Adding to 2010034393 its reverse (3934300102), we get a palindrome (5944334495).
The spelling of 2010034393 in words is "two billion, ten million, thirty-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •