Base | Representation |
---|---|
bin | 11100001110101011… |
… | …110011000011011001 |
3 | 2220020102202010011102 |
4 | 130032223303003121 |
5 | 444034122232101 |
6 | 21531424441145 |
7 | 2122065245213 |
oct | 341653630331 |
9 | 86212663142 |
10 | 30311133401 |
11 | 1194493217a |
12 | 5a5b1791b5 |
13 | 2b209905c3 |
14 | 16778b95b3 |
15 | bc60d686b |
hex | 70eaf30d9 |
30311133401 has 2 divisors, whose sum is σ = 30311133402. Its totient is φ = 30311133400.
The previous prime is 30311133353. The next prime is 30311133403. The reversal of 30311133401 is 10433111303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29982654025 + 328479376 = 173155^2 + 18124^2 .
It is an emirp because it is prime and its reverse (10433111303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30311133401 - 222 = 30306939097 is a prime.
Together with 30311133403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (30311133403) 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, 15155566700 + 15155566701.
It is an arithmetic number, because the mean of its divisors is an integer number (15155566701).
Almost surely, 230311133401 is an apocalyptic number.
It is an amenable number.
30311133401 is a deficient number, since it is larger than the sum of its proper divisors (1).
30311133401 is an equidigital number, since it uses as much as digits as its factorization.
30311133401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 30311133401 its reverse (10433111303), we get a palindrome (40744244704).
The spelling of 30311133401 in words is "thirty billion, three hundred eleven million, one hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •