Base | Representation |
---|---|
bin | 11001000011101000110001… |
… | …011011101001011110000110 |
3 | 112110012010022011002000212212 |
4 | 121003220301123221132012 |
5 | 103421013323123241402 |
6 | 1030213404143143422 |
7 | 32132523665232164 |
oct | 3103506133513606 |
9 | 473163264060785 |
10 | 110201100212102 |
11 | 3212802a150a99 |
12 | 104398655a4b72 |
13 | 4964bc45169c3 |
14 | 1d2da941b8234 |
15 | cb18b4560952 |
hex | 643a316e9786 |
110201100212102 has 8 divisors (see below), whose sum is σ = 166042913324736. Its totient is φ = 54853462437192.
The previous prime is 110201100212089. The next prime is 110201100212107. The reversal of 110201100212102 is 201212001102011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110201100212107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 123543833873 + ... + 123543834764.
It is an arithmetic number, because the mean of its divisors is an integer number (20755364165592).
Almost surely, 2110201100212102 is an apocalyptic number.
110201100212102 is a deficient number, since it is larger than the sum of its proper divisors (55841813112634).
110201100212102 is a wasteful number, since it uses less digits than its factorization.
110201100212102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247087668862.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110201100212102 its reverse (201212001102011), we get a palindrome (311413101314113).
The spelling of 110201100212102 in words is "one hundred ten trillion, two hundred one billion, one hundred million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •