Base | Representation |
---|---|
bin | 110011011110110011… |
… | …1110000111001100101 |
3 | 101120100210200022022002 |
4 | 1212331213300321211 |
5 | 3302404202001013 |
6 | 122442152015045 |
7 | 10662445150241 |
oct | 1467547607145 |
9 | 346323608262 |
10 | 110555500133 |
11 | 42982774631 |
12 | 19514991485 |
13 | a56b614a00 |
14 | 54caca5421 |
15 | 2d20c75358 |
hex | 19bd9f0e65 |
110555500133 has 24 divisors (see below), whose sum is σ = 123078654216. Its totient is φ = 99201024000.
The previous prime is 110555500129. The next prime is 110555500147. The reversal of 110555500133 is 331005555011.
It can be written as a sum of positive squares in 12 ways, for example, as 62997486049 + 47558014084 = 250993^2 + 218078^2 .
It is not a de Polignac number, because 110555500133 - 22 = 110555500129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110555500096 and 110555500105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110555500103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1890533 + ... + 1948133.
It is an arithmetic number, because the mean of its divisors is an integer number (5128277259).
Almost surely, 2110555500133 is an apocalyptic number.
110555500133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
110555500133 is a deficient number, since it is larger than the sum of its proper divisors (12523154083).
110555500133 is a wasteful number, since it uses less digits than its factorization.
110555500133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57945 (or 57932 counting only the distinct ones).
The product of its (nonzero) digits is 5625, while the sum is 29.
The spelling of 110555500133 in words is "one hundred ten billion, five hundred fifty-five million, five hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •