Base | Representation |
---|---|
bin | 11001000011110010000000… |
… | …110000110101101110110001 |
3 | 112110020001220112222110100111 |
4 | 121003302000300311232301 |
5 | 103421144132400231001 |
6 | 1030222124422221321 |
7 | 32133324562345351 |
oct | 3103620060655661 |
9 | 473201815873314 |
10 | 110211021102001 |
11 | 32131260242456 |
12 | 1043b773b84841 |
13 | 4965b159c5b61 |
14 | 1d30355a26b61 |
15 | cb1c954e3851 |
hex | 643c80c35bb1 |
110211021102001 has 4 divisors (see below), whose sum is σ = 110211130335232. Its totient is φ = 110210911868772.
The previous prime is 110211021101959. The next prime is 110211021102011. The reversal of 110211021102001 is 100201120112011.
It is a happy number.
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 110211021102001 - 27 = 110211021101873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110211021102011) 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, 53088945 + ... + 55125838.
It is an arithmetic number, because the mean of its divisors is an integer number (27552782583808).
Almost surely, 2110211021102001 is an apocalyptic number.
It is an amenable number.
110211021102001 is a deficient number, since it is larger than the sum of its proper divisors (109233231).
110211021102001 is a wasteful number, since it uses less digits than its factorization.
110211021102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109233230.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110211021102001 its reverse (100201120112011), we get a palindrome (210412141214012).
The spelling of 110211021102001 in words is "one hundred ten trillion, two hundred eleven billion, twenty-one million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •