Base | Representation |
---|---|
bin | 110011011010001011… |
… | …1100000011000110010 |
3 | 101112221222112102220011 |
4 | 1212310113200120302 |
5 | 3302044430241000 |
6 | 122414524205134 |
7 | 10655551404253 |
oct | 1466427403062 |
9 | 345858472804 |
10 | 110400243250 |
11 | 42903071860 |
12 | 194909997aa |
13 | a5453c512b |
14 | 54b440cb2a |
15 | 2d123082ba |
hex | 19b45e0632 |
110400243250 has 64 divisors (see below), whose sum is σ = 225684351360. Its totient is φ = 40105128000.
The previous prime is 110400243241. The next prime is 110400243251. The reversal of 110400243250 is 52342004011.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (110400243251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2782552 + ... + 2821948.
It is an arithmetic number, because the mean of its divisors is an integer number (3526317990).
Almost surely, 2110400243250 is an apocalyptic number.
110400243250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110400243250 is an abundant number, since it is smaller than the sum of its proper divisors (115284108110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110400243250 is a wasteful number, since it uses less digits than its factorization.
110400243250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40444 (or 40434 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 22.
Adding to 110400243250 its reverse (52342004011), we get a palindrome (162742247261).
The spelling of 110400243250 in words is "one hundred ten billion, four hundred million, two hundred forty-three thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •