Base | Representation |
---|---|
bin | 11001000010011101001111… |
… | …100110111001101100101011 |
3 | 112102220100222021200002021201 |
4 | 121002131033212321230223 |
5 | 103413201231014200021 |
6 | 1030112233001145031 |
7 | 32123623210526461 |
oct | 3102351746715453 |
9 | 472810867602251 |
10 | 110120002100011 |
11 | 320a66a33aa062 |
12 | 10425bb1a8b177 |
13 | 495a36ba42627 |
14 | 1d29b9d672831 |
15 | cae719980591 |
hex | 64274f9b9b2b |
110120002100011 has 4 divisors (see below), whose sum is σ = 110143416946752. Its totient is φ = 110096587253272.
The previous prime is 110120002099997. The next prime is 110120002100027. The reversal of 110120002100011 is 110001200021011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110120002100011 - 213 = 110120002091819 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110120002100111) 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, 11707416316 + ... + 11707425721.
It is an arithmetic number, because the mean of its divisors is an integer number (27535854236688).
Almost surely, 2110120002100011 is an apocalyptic number.
110120002100011 is a deficient number, since it is larger than the sum of its proper divisors (23414846741).
110120002100011 is an equidigital number, since it uses as much as digits as its factorization.
110120002100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23414846740.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 110120002100011 its reverse (110001200021011), we get a palindrome (220121202121022).
It can be divided in two parts, 1101200021000 and 11, that added together give a palindrome (1101200021011).
The spelling of 110120002100011 in words is "one hundred ten trillion, one hundred twenty billion, two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •