Base | Representation |
---|---|
bin | 11011111101100000… |
… | …101010010000001101 |
3 | 2212111100120110221202 |
4 | 123331200222100031 |
5 | 442441342013401 |
6 | 21443053035245 |
7 | 2111666204312 |
oct | 337540522015 |
9 | 85440513852 |
10 | 30023001101 |
11 | 11807224105 |
12 | 599a785b25 |
13 | 2aa6089512 |
14 | 164b514d09 |
15 | baab6e06b |
hex | 6fd82a40d |
30023001101 has 2 divisors, whose sum is σ = 30023001102. Its totient is φ = 30023001100.
The previous prime is 30023001097. The next prime is 30023001139. The reversal of 30023001101 is 10110032003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27348559876 + 2674441225 = 165374^2 + 51715^2 .
It is an emirp because it is prime and its reverse (10110032003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30023001101 - 22 = 30023001097 is a prime.
It is a super-2 number, since 2×300230011012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30023001191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15011500550 + 15011500551.
It is an arithmetic number, because the mean of its divisors is an integer number (15011500551).
Almost surely, 230023001101 is an apocalyptic number.
It is an amenable number.
30023001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30023001101 is an equidigital number, since it uses as much as digits as its factorization.
30023001101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 30023001101 its reverse (10110032003), we get a palindrome (40133033104).
The spelling of 30023001101 in words is "thirty billion, twenty-three million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •