Base | Representation |
---|---|
bin | 11100000010110010… |
… | …110001111011010001 |
3 | 2212201112100122211021 |
4 | 130002302301323101 |
5 | 443132034342301 |
6 | 21455540515441 |
7 | 2114123456512 |
oct | 340262617321 |
9 | 85645318737 |
10 | 30111637201 |
11 | 11852263788 |
12 | 5a043abb81 |
13 | 2abb551709 |
14 | 16591c8a09 |
15 | bb382b8a1 |
hex | 702cb1ed1 |
30111637201 has 4 divisors (see below), whose sum is σ = 30148314804. Its totient is φ = 30074959600.
The previous prime is 30111637189. The next prime is 30111637253. The reversal of 30111637201 is 10273611103.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14719512976 + 15392124225 = 121324^2 + 124065^2 .
It is a cyclic number.
It is not a de Polignac number, because 30111637201 - 25 = 30111637169 is a prime.
It is a super-2 number, since 2×301116372012 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30111637261) 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 in 3 ways as a sum of consecutive naturals, for example, 18337570 + ... + 18339211.
It is an arithmetic number, because the mean of its divisors is an integer number (7537078701).
Almost surely, 230111637201 is an apocalyptic number.
It is an amenable number.
30111637201 is a deficient number, since it is larger than the sum of its proper divisors (36677603).
30111637201 is an equidigital number, since it uses as much as digits as its factorization.
30111637201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36677602.
The product of its (nonzero) digits is 756, while the sum is 25.
The spelling of 30111637201 in words is "thirty billion, one hundred eleven million, six hundred thirty-seven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •