Base | Representation |
---|---|
bin | 1101101111010100101100… |
… | …10110101111100100100001 |
3 | 10221222100212101121210102102 |
4 | 12313222112112233210201 |
5 | 12430003341030120411 |
6 | 144131450404500145 |
7 | 6235561203640154 |
oct | 667522626574441 |
9 | 127870771553372 |
10 | 30213322504481 |
11 | 9699441992036 |
12 | 347b6646aa655 |
13 | 13b21478aa26c |
14 | 766492987c9b |
15 | 375db7b56d3b |
hex | 1b7a965af921 |
30213322504481 has 2 divisors, whose sum is σ = 30213322504482. Its totient is φ = 30213322504480.
The previous prime is 30213322504441. The next prime is 30213322504493. The reversal of 30213322504481 is 18440522331203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29712136381456 + 501186123025 = 5450884^2 + 707945^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30213322504481 is a prime.
It is a super-2 number, since 2×302133225044812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30213322504441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106661252240 + 15106661252241.
It is an arithmetic number, because the mean of its divisors is an integer number (15106661252241).
Almost surely, 230213322504481 is an apocalyptic number.
It is an amenable number.
30213322504481 is a deficient number, since it is larger than the sum of its proper divisors (1).
30213322504481 is an equidigital number, since it uses as much as digits as its factorization.
30213322504481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 38.
Adding to 30213322504481 its reverse (18440522331203), we get a palindrome (48653844835684).
The spelling of 30213322504481 in words is "thirty trillion, two hundred thirteen billion, three hundred twenty-two million, five hundred four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •