Base | Representation |
---|---|
bin | 11001000011101000110111… |
… | …111110011101011101001100 |
3 | 112110012010120210122220020210 |
4 | 121003220313332131131030 |
5 | 103421014034230014403 |
6 | 1030213423104242420 |
7 | 32132526500355123 |
oct | 3103506776353514 |
9 | 473163523586223 |
10 | 110201210001228 |
11 | 32128086119205 |
12 | 10439896310410 |
13 | 4964c111a7098 |
14 | 1d2daa49d6aba |
15 | cb18bdeeab03 |
hex | 643a37f9d74c |
110201210001228 has 48 divisors (see below), whose sum is σ = 261177725365760. Its totient is φ = 36159179284800.
The previous prime is 110201210001227. The next prime is 110201210001229. The reversal of 110201210001228 is 822100012102011.
110201210001228 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (110201210001227) and next prime (110201210001229).
It is not an unprimeable number, because it can be changed into a prime (110201210001227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 175284403 + ... + 175911978.
Almost surely, 2110201210001228 is an apocalyptic number.
It is an amenable number.
110201210001228 is an abundant number, since it is smaller than the sum of its proper divisors (150976515364532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201210001228 is a wasteful number, since it uses less digits than its factorization.
110201210001228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351196798 (or 351196796 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 110201210001228 its reverse (822100012102011), we get a palindrome (932301222103239).
The spelling of 110201210001228 in words is "one hundred ten trillion, two hundred one billion, two hundred ten million, one thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.193 sec. • engine limits •