Base | Representation |
---|---|
bin | 111100011111111… |
… | …1101100010111001 |
3 | 12020110212100212102 |
4 | 1320333331202321 |
5 | 13124142024311 |
6 | 533234353145 |
7 | 101206665536 |
oct | 17077754271 |
9 | 5213770772 |
10 | 2030033081 |
11 | 95199a99a |
12 | 487a2b7b5 |
13 | 26476140b |
14 | 153875d8d |
15 | bd34643b |
hex | 78ffd8b9 |
2030033081 has 2 divisors, whose sum is σ = 2030033082. Its totient is φ = 2030033080.
The previous prime is 2030033063. The next prime is 2030033099. The reversal of 2030033081 is 1803300302.
It is a balanced prime because it is at equal distance from previous prime (2030033063) and next prime (2030033099).
It can be written as a sum of positive squares in only one way, i.e., 1694557225 + 335475856 = 41165^2 + 18316^2 .
It is a cyclic number.
It is not a de Polignac number, because 2030033081 - 214 = 2030016697 is a prime.
It is a super-2 number, since 2×20300330812 = 8242068619908705122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2030033281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1015016540 + 1015016541.
It is an arithmetic number, because the mean of its divisors is an integer number (1015016541).
Almost surely, 22030033081 is an apocalyptic number.
It is an amenable number.
2030033081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2030033081 is an equidigital number, since it uses as much as digits as its factorization.
2030033081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 2030033081 is about 45055.8884164989. Note that the first 3 decimals coincide. The cubic root of 2030033081 is about 1266.1962949339.
Adding to 2030033081 its reverse (1803300302), we get a palindrome (3833333383).
The spelling of 2030033081 in words is "two billion, thirty million, thirty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •