Base | Representation |
---|---|
bin | 111011100110111… |
… | …0000001101001101 |
3 | 12011101112022012122 |
4 | 1313031300031031 |
5 | 13044011002104 |
6 | 530244542325 |
7 | 100364342633 |
oct | 16715601515 |
9 | 5141468178 |
10 | 2000094029 |
11 | 93700127a |
12 | 4799b19a5 |
13 | 25b4ab0bb |
14 | 14d8c1353 |
15 | ba8d06be |
hex | 7737034d |
2000094029 has 2 divisors, whose sum is σ = 2000094030. Its totient is φ = 2000094028.
The previous prime is 2000094023. The next prime is 2000094059. The reversal of 2000094029 is 9204900002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1581891529 + 418202500 = 39773^2 + 20450^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000094029 - 216 = 2000028493 is a prime.
It is a super-2 number, since 2×20000940292 = 8000752249682905682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2000093989 and 2000094007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2000094023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1000047014 + 1000047015.
It is an arithmetic number, because the mean of its divisors is an integer number (1000047015).
Almost surely, 22000094029 is an apocalyptic number.
It is an amenable number.
2000094029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2000094029 is an equidigital number, since it uses as much as digits as its factorization.
2000094029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 2000094029 is about 44722.4108138191. The cubic root of 2000094029 is about 1259.9407944382.
The spelling of 2000094029 in words is "two billion, ninety-four thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •