Base | Representation |
---|---|
bin | 11001000000110111101111… |
… | …001111010001010011000011 |
3 | 112102111221122111220010112001 |
4 | 121000313233033101103003 |
5 | 103404410022321010313 |
6 | 1025550205534044431 |
7 | 32113014260434366 |
oct | 3100675717212303 |
9 | 472457574803461 |
10 | 110011011110083 |
11 | 32064453877176 |
12 | 10408a55049717 |
13 | 494ccbc5b8a05 |
14 | 1d247c04a40dd |
15 | cab98b248add |
hex | 640def3d14c3 |
110011011110083 has 8 divisors (see below), whose sum is σ = 114931271425680. Its totient is φ = 105165869272800.
The previous prime is 110011011110081. The next prime is 110011011110107. The reversal of 110011011110083 is 380011110110011.
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 110011011110083 - 21 = 110011011110081 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 110011011110083.
It is not an unprimeable number, because it can be changed into a prime (110011011110081) 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, 18779616585 + ... + 18779622442.
It is an arithmetic number, because the mean of its divisors is an integer number (14366408928210).
Almost surely, 2110011011110083 is an apocalyptic number.
110011011110083 is a deficient number, since it is larger than the sum of its proper divisors (4920260315597).
110011011110083 is a wasteful number, since it uses less digits than its factorization.
110011011110083 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37559239157.
The product of its (nonzero) digits is 24, while the sum is 19.
Adding to 110011011110083 its reverse (380011110110011), we get a palindrome (490022121220094).
The spelling of 110011011110083 in words is "one hundred ten trillion, eleven billion, eleven million, one hundred ten thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •