Base | Representation |
---|---|
bin | 11100000010001010… |
… | …100110001000001001 |
3 | 2212200210112110202212 |
4 | 130002022212020021 |
5 | 443121340244423 |
6 | 21454523034505 |
7 | 2113635104054 |
oct | 340212461011 |
9 | 85623473685 |
10 | 30101103113 |
11 | 11847319324 |
12 | 5a0096ba35 |
13 | 2ab9303a23 |
14 | 1657a45a9b |
15 | bb294a578 |
hex | 7022a6209 |
30101103113 has 8 divisors (see below), whose sum is σ = 30155137320. Its totient is φ = 30047109120.
The previous prime is 30101103101. The next prime is 30101103121. The reversal of 30101103113 is 31130110103.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8542935184 + 21558167929 = 92428^2 + 146827^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 30101103113 - 218 = 30100840969 is a prime.
It is a super-3 number, since 3×301011031133 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30101183113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1757873 + ... + 1774913.
It is an arithmetic number, because the mean of its divisors is an integer number (3769392165).
Almost surely, 230101103113 is an apocalyptic number.
It is an amenable number.
30101103113 is a deficient number, since it is larger than the sum of its proper divisors (54034207).
30101103113 is a wasteful number, since it uses less digits than its factorization.
30101103113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20107.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 30101103113 its reverse (31130110103), we get a palindrome (61231213216).
The spelling of 30101103113 in words is "thirty billion, one hundred one million, one hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •