Base | Representation |
---|---|
bin | 11100100010000011… |
… | …100000100010010001 |
3 | 2221002002020221122011 |
4 | 130202003200202101 |
5 | 1000220321203423 |
6 | 22023554142521 |
7 | 2133122455531 |
oct | 344203404221 |
9 | 87062227564 |
10 | 30636116113 |
11 | 11aa131a529 |
12 | 5b2bb81a41 |
13 | 2b730c7775 |
14 | 16a8b134c1 |
15 | be48ccb0d |
hex | 7220e0891 |
30636116113 has 4 divisors (see below), whose sum is σ = 31692533940. Its totient is φ = 29579698288.
The previous prime is 30636116101. The next prime is 30636116149. The reversal of 30636116113 is 31161163603.
It is a happy number.
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 11726290944 + 18909825169 = 108288^2 + 137513^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30636116113 is a prime.
It is a super-2 number, since 2×306361161132 (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 (30636116713) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 528208870 + ... + 528208927.
It is an arithmetic number, because the mean of its divisors is an integer number (7923133485).
Almost surely, 230636116113 is an apocalyptic number.
It is an amenable number.
30636116113 is a deficient number, since it is larger than the sum of its proper divisors (1056417827).
30636116113 is a wasteful number, since it uses less digits than its factorization.
30636116113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1056417826.
The product of its (nonzero) digits is 5832, while the sum is 31.
Adding to 30636116113 its reverse (31161163603), we get a palindrome (61797279716).
The spelling of 30636116113 in words is "thirty billion, six hundred thirty-six million, one hundred sixteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •