Base | Representation |
---|---|
bin | 11100101010001001… |
… | …110111100100111001 |
3 | 2221102112221121202202 |
4 | 130222021313210321 |
5 | 1001010113013311 |
6 | 22045250435545 |
7 | 2136362456603 |
oct | 345211674471 |
9 | 87375847682 |
10 | 30772001081 |
11 | 12060aa0958 |
12 | 5b69592bb5 |
13 | 2b952c3a83 |
14 | 16bcba6173 |
15 | c017bee3b |
hex | 72a277939 |
30772001081 has 2 divisors, whose sum is σ = 30772001082. Its totient is φ = 30772001080.
The previous prime is 30772001059. The next prime is 30772001153. The reversal of 30772001081 is 18010027703.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29303961856 + 1468039225 = 171184^2 + 38315^2 .
It is an emirp because it is prime and its reverse (18010027703) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30772001081 - 222 = 30767806777 is a prime.
It is a super-2 number, since 2×307720010812 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30772001021) 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, 15386000540 + 15386000541.
It is an arithmetic number, because the mean of its divisors is an integer number (15386000541).
Almost surely, 230772001081 is an apocalyptic number.
It is an amenable number.
30772001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
30772001081 is an equidigital number, since it uses as much as digits as its factorization.
30772001081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 29.
Adding to 30772001081 its reverse (18010027703), we get a palindrome (48782028784).
The spelling of 30772001081 in words is "thirty billion, seven hundred seventy-two million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •