Base | Representation |
---|---|
bin | 11011111110011101… |
… | …001111101011100001 |
3 | 2212112110110100212202 |
4 | 123332131033223201 |
5 | 443004423224131 |
6 | 21444421302545 |
7 | 2112251202326 |
oct | 337635175341 |
9 | 85473410782 |
10 | 30038883041 |
11 | 11815191482 |
12 | 59a3b64a55 |
13 | 2aa945a40b |
14 | 164d68ab4d |
15 | bac259bcb |
hex | 6fe74fae1 |
30038883041 has 2 divisors, whose sum is σ = 30038883042. Its totient is φ = 30038883040.
The previous prime is 30038883001. The next prime is 30038883053. The reversal of 30038883041 is 14038883003.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25908121600 + 4130761441 = 160960^2 + 64271^2 .
It is a cyclic number.
It is not a de Polignac number, because 30038883041 - 210 = 30038882017 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30038882986 and 30038883004.
It is not a weakly prime, because it can be changed into another prime (30038883001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15019441520 + 15019441521.
It is an arithmetic number, because the mean of its divisors is an integer number (15019441521).
Almost surely, 230038883041 is an apocalyptic number.
It is an amenable number.
30038883041 is a deficient number, since it is larger than the sum of its proper divisors (1).
30038883041 is an equidigital number, since it uses as much as digits as its factorization.
30038883041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 38.
Subtracting from 30038883041 its sum of digits (38), we obtain a palindrome (30038883003).
The spelling of 30038883041 in words is "thirty billion, thirty-eight million, eight hundred eighty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •