Base | Representation |
---|---|
bin | 11100100110011101… |
… | …110001101110111001 |
3 | 2221021020111021202111 |
4 | 130212131301232321 |
5 | 1000343242024121 |
6 | 22035200132321 |
7 | 2135011431532 |
oct | 344635615671 |
9 | 87236437674 |
10 | 30710111161 |
11 | 1202a06a064 |
12 | 5b509070a1 |
13 | 2b85534812 |
14 | 16b4895689 |
15 | beb1472e1 |
hex | 726771bb9 |
30710111161 has 2 divisors, whose sum is σ = 30710111162. Its totient is φ = 30710111160.
The previous prime is 30710111153. The next prime is 30710111177. The reversal of 30710111161 is 16111101703.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20461585936 + 10248525225 = 143044^2 + 101235^2 .
It is a cyclic number.
It is not a de Polignac number, because 30710111161 - 23 = 30710111153 is a prime.
It is a super-2 number, since 2×307101111612 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30710111101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15355055580 + 15355055581.
It is an arithmetic number, because the mean of its divisors is an integer number (15355055581).
Almost surely, 230710111161 is an apocalyptic number.
It is an amenable number.
30710111161 is a deficient number, since it is larger than the sum of its proper divisors (1).
30710111161 is an equidigital number, since it uses as much as digits as its factorization.
30710111161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 22.
Adding to 30710111161 its reverse (16111101703), we get a palindrome (46821212864).
The spelling of 30710111161 in words is "thirty billion, seven hundred ten million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •