Base | Representation |
---|---|
bin | 110100101000010001… |
… | …0010011110101010110 |
3 | 101210201120200012000220 |
4 | 1221100202103311112 |
5 | 3322431200233420 |
6 | 123530521415210 |
7 | 11110514610234 |
oct | 1512042236526 |
9 | 353646605026 |
10 | 113020321110 |
11 | 43a28030064 |
12 | 19aa233a506 |
13 | a872177a68 |
14 | 5682399954 |
15 | 2e17352840 |
hex | 1a50893d56 |
113020321110 has 32 divisors (see below), whose sum is σ = 279998733312. Its totient is φ = 29166534240.
The previous prime is 113020321109. The next prime is 113020321151. The reversal of 113020321110 is 11123020311.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 113020321110.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 60762684 + ... + 60764543.
It is an arithmetic number, because the mean of its divisors is an integer number (8749960416).
Almost surely, 2113020321110 is an apocalyptic number.
113020321110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113020321110 is an abundant number, since it is smaller than the sum of its proper divisors (166978412202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113020321110 is a wasteful number, since it uses less digits than its factorization.
113020321110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121527268.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 113020321110 its reverse (11123020311), we get a palindrome (124143341421).
The spelling of 113020321110 in words is "one hundred thirteen billion, twenty million, three hundred twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •