Base | Representation |
---|---|
bin | 111100101000111… |
… | …0100010000100001 |
3 | 12020210200011101012 |
4 | 1321101310100201 |
5 | 13131341314013 |
6 | 533522550305 |
7 | 101264531501 |
oct | 17121642041 |
9 | 5223604335 |
10 | 2034713633 |
11 | 9545a7517 |
12 | 489508395 |
13 | 26570c984 |
14 | 154333a01 |
15 | bd96d1a8 |
hex | 79474421 |
2034713633 has 2 divisors, whose sum is σ = 2034713634. Its totient is φ = 2034713632.
The previous prime is 2034713617. The next prime is 2034713647. The reversal of 2034713633 is 3363174302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1948074769 + 86638864 = 44137^2 + 9308^2 .
It is a cyclic number.
It is not a de Polignac number, because 2034713633 - 24 = 2034713617 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2034713633.
It is not a weakly prime, because it can be changed into another prime (2034713033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1017356816 + 1017356817.
It is an arithmetic number, because the mean of its divisors is an integer number (1017356817).
Almost surely, 22034713633 is an apocalyptic number.
It is an amenable number.
2034713633 is a deficient number, since it is larger than the sum of its proper divisors (1).
2034713633 is an equidigital number, since it uses as much as digits as its factorization.
2034713633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 32.
The square root of 2034713633 is about 45107.8001347882. The cubic root of 2034713633 is about 1267.1686844425.
Adding to 2034713633 its reverse (3363174302), we get a palindrome (5397887935).
The spelling of 2034713633 in words is "two billion, thirty-four million, seven hundred thirteen thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •