Base | Representation |
---|---|
bin | 110011010101011110… |
… | …1011000101111001100 |
3 | 101112112222112020100100 |
4 | 1212222331120233030 |
5 | 3301234023314403 |
6 | 122351125131100 |
7 | 10651623643401 |
oct | 1465275305714 |
9 | 345488466310 |
10 | 110242401228 |
11 | 42831a63803 |
12 | 19447b59a90 |
13 | a51b7ab99b |
14 | 549b4822a8 |
15 | 2d0352a2a3 |
hex | 19aaf58bcc |
110242401228 has 36 divisors (see below), whose sum is σ = 278686207800. Its totient is φ = 36745104576.
The previous prime is 110242401187. The next prime is 110242401229. The reversal of 110242401228 is 822104242011.
110242401228 is a `hidden beast` number, since 1 + 10 + 2 + 424 + 0 + 1 + 228 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is not an unprimeable number, because it can be changed into a prime (110242401229) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 523048 + ... + 702896.
It is an arithmetic number, because the mean of its divisors is an integer number (7741283550).
Almost surely, 2110242401228 is an apocalyptic number.
110242401228 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
110242401228 is an abundant number, since it is smaller than the sum of its proper divisors (168443806572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110242401228 is a wasteful number, since it uses less digits than its factorization.
110242401228 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196886 (or 196881 counting only the distinct ones).
The product of its (nonzero) digits is 2048, while the sum is 27.
Adding to 110242401228 its reverse (822104242011), we get a palindrome (932346643239).
The spelling of 110242401228 in words is "one hundred ten billion, two hundred forty-two million, four hundred one thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •