Base | Representation |
---|---|
bin | 11001000011101000110001… |
… | …011011001110100111100000 |
3 | 112110012010022010212110000011 |
4 | 121003220301123032213200 |
5 | 103421013323111231422 |
6 | 1030213404140534304 |
7 | 32132523664263415 |
oct | 3103506133164740 |
9 | 473163263773004 |
10 | 110201100102112 |
11 | 3212802a086398 |
12 | 10439865551394 |
13 | 4964bc44a8916 |
14 | 1d2da9418a10c |
15 | cb18b453d077 |
hex | 643a316ce9e0 |
110201100102112 has 48 divisors (see below), whose sum is σ = 220640075938800. Its totient is φ = 54165562501120.
The previous prime is 110201100102101. The next prime is 110201100102157. The reversal of 110201100102112 is 211201001102011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 110201100102092 and 110201100102101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98619162 + ... + 99730342.
It is an arithmetic number, because the mean of its divisors is an integer number (4596668248725).
Almost surely, 2110201100102112 is an apocalyptic number.
It is an amenable number.
110201100102112 is an abundant number, since it is smaller than the sum of its proper divisors (110438975836688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201100102112 is a wasteful number, since it uses less digits than its factorization.
110201100102112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1163779 (or 1163771 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110201100102112 its reverse (211201001102011), we get a palindrome (321402101204123).
The spelling of 110201100102112 in words is "one hundred ten trillion, two hundred one billion, one hundred million, one hundred two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •