Base | Representation |
---|---|
bin | 110011010100100110… |
… | …1101111001101000000 |
3 | 101112110221110021001100 |
4 | 1212221031233031000 |
5 | 3301204030224440 |
6 | 122344201534400 |
7 | 10651120113546 |
oct | 1465115571500 |
9 | 345427407040 |
10 | 110213133120 |
11 | 42817493192 |
12 | 1943a1a4400 |
13 | a515701b8c |
14 | 5497623d96 |
15 | 2d00b98230 |
hex | 19a936f340 |
110213133120 has 84 divisors (see below), whose sum is σ = 379087265700. Its totient is φ = 29390168064.
The previous prime is 110213133097. The next prime is 110213133193. The reversal of 110213133120 is 21331312011.
It can be written as a sum of positive squares in 2 ways, for example, as 28823890176 + 81389242944 = 169776^2 + 285288^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 110213133093 and 110213133102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19131345 + ... + 19137104.
Almost surely, 2110213133120 is an apocalyptic number.
110213133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110213133120 is an abundant number, since it is smaller than the sum of its proper divisors (268874132580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110213133120 is a wasteful number, since it uses less digits than its factorization.
110213133120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38268472 (or 38268459 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 110213133120 its reverse (21331312011), we get a palindrome (131544445131).
The spelling of 110213133120 in words is "one hundred ten billion, two hundred thirteen million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •