Base | Representation |
---|---|
bin | 110100101110000010… |
… | …1001110000111011110 |
3 | 101211020002011012212000 |
4 | 1221130011032013132 |
5 | 3323330242201420 |
6 | 124002041223130 |
7 | 11115356211210 |
oct | 1513405160736 |
9 | 354202135760 |
10 | 113214022110 |
11 | 44017400532 |
12 | 19b37191aa6 |
13 | a8a3337c37 |
14 | 569ddbc5b0 |
15 | 2e29365690 |
hex | 1a5c14e1de |
113214022110 has 64 divisors (see below), whose sum is σ = 345033216000. Its totient is φ = 25877490336.
The previous prime is 113214022093. The next prime is 113214022151. The reversal of 113214022110 is 11220412311.
It is a super-3 number, since 3×1132140221103 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 29948910 + ... + 29952689.
It is an arithmetic number, because the mean of its divisors is an integer number (5391144000).
Almost surely, 2113214022110 is an apocalyptic number.
113214022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113214022110 is an abundant number, since it is smaller than the sum of its proper divisors (231819193890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113214022110 is a wasteful number, since it uses less digits than its factorization.
113214022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59901622 (or 59901616 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 113214022110 its reverse (11220412311), we get a palindrome (124434434421).
The spelling of 113214022110 in words is "one hundred thirteen billion, two hundred fourteen million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •