Base | Representation |
---|---|
bin | 11100000010101100… |
… | …100100111011011101 |
3 | 2212201102022001020100 |
4 | 130002230210323131 |
5 | 443131130323401 |
6 | 21455442011313 |
7 | 2114103604632 |
oct | 340254447335 |
9 | 85642261210 |
10 | 30110011101 |
11 | 11851352aa5 |
12 | 5a03946b39 |
13 | 2abb102521 |
14 | 1658cc4189 |
15 | bb3609b86 |
hex | 702b24edd |
30110011101 has 12 divisors (see below), whose sum is σ = 44312847228. Its totient is φ = 19694598144.
The previous prime is 30110011093. The next prime is 30110011123. The reversal of 30110011101 is 10111001103.
It can be written as a sum of positive squares in 2 ways, for example, as 7443203076 + 22666808025 = 86274^2 + 150555^2 .
It is not a de Polignac number, because 30110011101 - 23 = 30110011093 is a prime.
It is a super-2 number, since 2×301100111012 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30110091101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31561380 + ... + 31562333.
It is an arithmetic number, because the mean of its divisors is an integer number (3692737269).
Almost surely, 230110011101 is an apocalyptic number.
It is an amenable number.
30110011101 is a deficient number, since it is larger than the sum of its proper divisors (14202836127).
30110011101 is a wasteful number, since it uses less digits than its factorization.
30110011101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63123772 (or 63123769 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 30110011101 its reverse (10111001103), we get a palindrome (40221012204).
The spelling of 30110011101 in words is "thirty billion, one hundred ten million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •