Base | Representation |
---|---|
bin | 11001001111101100110001… |
… | …011111111000011101100101 |
3 | 112120010100220200201210020121 |
4 | 121033230301133320131211 |
5 | 104023104000140311323 |
6 | 1032050254105401541 |
7 | 32246440435245016 |
oct | 3117546137703545 |
9 | 476110820653217 |
10 | 111030030010213 |
11 | 32417631437246 |
12 | 105524444992b1 |
13 | 49c5118c0b8c2 |
14 | 1d5bc4c7a500d |
15 | cc822c52ea5d |
hex | 64fb317f8765 |
111030030010213 has 4 divisors (see below), whose sum is σ = 111067052364000. Its totient is φ = 110993007656428.
The previous prime is 111030030010199. The next prime is 111030030010231. The reversal of 111030030010213 is 312010030030111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 111030030010213 - 217 = 111030029879141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111030030010313) 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, 18511172395 + ... + 18511178392.
It is an arithmetic number, because the mean of its divisors is an integer number (27766763091000).
Almost surely, 2111030030010213 is an apocalyptic number.
It is an amenable number.
111030030010213 is a deficient number, since it is larger than the sum of its proper divisors (37022353787).
111030030010213 is an equidigital number, since it uses as much as digits as its factorization.
111030030010213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37022353786.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 111030030010213 its reverse (312010030030111), we get a palindrome (423040060040324).
The spelling of 111030030010213 in words is "one hundred eleven trillion, thirty billion, thirty million, ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •