Base | Representation |
---|---|
bin | 110011010100010000… |
… | …0100110100010000000 |
3 | 101112110010012010121010 |
4 | 1212220200212202000 |
5 | 3301143013113440 |
6 | 122343100200520 |
7 | 10650614414121 |
oct | 1465040464200 |
9 | 345403163533 |
10 | 110201301120 |
11 | 42810841679 |
12 | 19436239140 |
13 | a51311b4b1 |
14 | 5495c24048 |
15 | 2ceeb0c580 |
hex | 19a8826880 |
110201301120 has 128 divisors (see below), whose sum is σ = 369754488000. Its totient is φ = 27840319488.
The previous prime is 110201301107. The next prime is 110201301281. The reversal of 110201301120 is 21103102011.
It is a tau number, because it is divible by the number of its divisors (128).
It is a super-3 number, since 3×1102013011203 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 110201301096 and 110201301105.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1473955 + ... + 1546914.
Almost surely, 2110201301120 is an apocalyptic number.
110201301120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110201301120 is an abundant number, since it is smaller than the sum of its proper divisors (259553186880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201301120 is a wasteful number, since it uses less digits than its factorization.
110201301120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3020910 (or 3020898 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 110201301120 its reverse (21103102011), we get a palindrome (131304403131).
The spelling of 110201301120 in words is "one hundred ten billion, two hundred one million, three hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •