Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000010111111110010101010 |
3 | 112102212111201220211002210021 |
4 | 121002110313002333302222 |
5 | 103413024312011200020 |
6 | 1030104143425111054 |
7 | 32123154142015510 |
oct | 3102246702776252 |
9 | 472774656732707 |
10 | 110111000100010 |
11 | 320a28a3a72238 |
12 | 104242bb18848a |
13 | 4959565a41c00 |
14 | 1d29587c9a4b0 |
15 | cae38e50b1aa |
hex | 6425370bfcaa |
110111000100010 has 192 divisors, whose sum is σ = 246387194496000. Its totient is φ = 34690901446656.
The previous prime is 110111000099993. The next prime is 110111000100047. The reversal of 110111000100010 is 10001000111011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 110111000099966 and 110111000100002.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13144438942 + ... + 13144447318.
It is an arithmetic number, because the mean of its divisors is an integer number (1283266638000).
Almost surely, 2110111000100010 is an apocalyptic number.
110111000100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110111000100010 is an abundant number, since it is smaller than the sum of its proper divisors (136276194395990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110111000100010 is a wasteful number, since it uses less digits than its factorization.
110111000100010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13305 (or 13292 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 110111000100010 its reverse (10001000111011), we get a palindrome (120112000211021).
The spelling of 110111000100010 in words is "one hundred ten trillion, one hundred eleven billion, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •