Base | Representation |
---|---|
bin | 1101101111100011000011… |
… | …11100111010111010100001 |
3 | 10222000002202202202111000201 |
4 | 12313301201330322322201 |
5 | 12430120134003121221 |
6 | 144135203452545201 |
7 | 6236253243143122 |
oct | 667614174727241 |
9 | 128002682674021 |
10 | 30221033254561 |
11 | 96a1739458766 |
12 | 3481056a82201 |
13 | 13b2aa6217686 |
14 | 7669c4a7a049 |
15 | 3761b9a68891 |
hex | 1b7c61f3aea1 |
30221033254561 has 2 divisors, whose sum is σ = 30221033254562. Its totient is φ = 30221033254560.
The previous prime is 30221033254549. The next prime is 30221033254567. The reversal of 30221033254561 is 16545233012203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16389744980625 + 13831288273936 = 4048425^2 + 3719044^2 .
It is a cyclic number.
It is not a de Polignac number, because 30221033254561 - 221 = 30221031157409 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30221033254561.
It is not a weakly prime, because it can be changed into another prime (30221033254567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15110516627280 + 15110516627281.
It is an arithmetic number, because the mean of its divisors is an integer number (15110516627281).
Almost surely, 230221033254561 is an apocalyptic number.
It is an amenable number.
30221033254561 is a deficient number, since it is larger than the sum of its proper divisors (1).
30221033254561 is an equidigital number, since it uses as much as digits as its factorization.
30221033254561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 30221033254561 its reverse (16545233012203), we get a palindrome (46766266266764).
The spelling of 30221033254561 in words is "thirty trillion, two hundred twenty-one billion, thirty-three million, two hundred fifty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •