Base | Representation |
---|---|
bin | 1101101001001100111101… |
… | …11100011101101111001101 |
3 | 10221020021000120120211211112 |
4 | 12310212132330131233031 |
5 | 12413032132340310013 |
6 | 143451105522501405 |
7 | 6214434431313152 |
oct | 664463674355715 |
9 | 127207016524745 |
10 | 30003013213133 |
11 | 961822a866744 |
12 | 3446950504865 |
13 | 139836c79b9bc |
14 | 75a221632229 |
15 | 3706a95ccba8 |
hex | 1b499ef1dbcd |
30003013213133 has 2 divisors, whose sum is σ = 30003013213134. Its totient is φ = 30003013213132.
The previous prime is 30003013213087. The next prime is 30003013213141. The reversal of 30003013213133 is 33131231030003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29745439707844 + 257573505289 = 5453938^2 + 507517^2 .
It is a cyclic number.
It is not a de Polignac number, because 30003013213133 - 220 = 30003012164557 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30003013213099 and 30003013213108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30003013213163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15001506606566 + 15001506606567.
It is an arithmetic number, because the mean of its divisors is an integer number (15001506606567).
Almost surely, 230003013213133 is an apocalyptic number.
It is an amenable number.
30003013213133 is a deficient number, since it is larger than the sum of its proper divisors (1).
30003013213133 is an equidigital number, since it uses as much as digits as its factorization.
30003013213133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 30003013213133 its reverse (33131231030003), we get a palindrome (63134244243136).
The spelling of 30003013213133 in words is "thirty trillion, three billion, thirteen million, two hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •