Base | Representation |
---|---|
bin | 111101110010101… |
… | …1111101001100001 |
3 | 12100111111222111011 |
4 | 1323211133221201 |
5 | 13221244122104 |
6 | 541424420521 |
7 | 102244556206 |
oct | 17345375141 |
9 | 5314458434 |
10 | 2073426529 |
11 | 974439049 |
12 | 49a477741 |
13 | 270745705 |
14 | 15952dcad |
15 | c2068904 |
hex | 7b95fa61 |
2073426529 has 2 divisors, whose sum is σ = 2073426530. Its totient is φ = 2073426528.
The previous prime is 2073426499. The next prime is 2073426559. The reversal of 2073426529 is 9256243702.
It is a balanced prime because it is at equal distance from previous prime (2073426499) and next prime (2073426559).
It can be written as a sum of positive squares in only one way, i.e., 1343075904 + 730350625 = 36648^2 + 27025^2 .
It is a cyclic number.
It is not a de Polignac number, because 2073426529 - 25 = 2073426497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2073426491 and 2073426500.
It is not a weakly prime, because it can be changed into another prime (2073426559) 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, 1036713264 + 1036713265.
It is an arithmetic number, because the mean of its divisors is an integer number (1036713265).
Almost surely, 22073426529 is an apocalyptic number.
It is an amenable number.
2073426529 is a deficient number, since it is larger than the sum of its proper divisors (1).
2073426529 is an equidigital number, since it uses as much as digits as its factorization.
2073426529 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 181440, while the sum is 40.
The square root of 2073426529 is about 45534.8935323231. The cubic root of 2073426529 is about 1275.1547225281.
The spelling of 2073426529 in words is "two billion, seventy-three million, four hundred twenty-six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •