Base | Representation |
---|---|
bin | 110100110100110100… |
… | …0101011001101101100 |
3 | 101211210221001020022021 |
4 | 1221221220223031230 |
5 | 3324312000421030 |
6 | 124040403155524 |
7 | 11124120106216 |
oct | 1515150531554 |
9 | 354727036267 |
10 | 113441420140 |
11 | 441237a6a94 |
12 | 19b9b375ba4 |
13 | a90b495a99 |
14 | 56c22935b6 |
15 | 2e3e2d297a |
hex | 1a69a2b36c |
113441420140 has 24 divisors (see below), whose sum is σ = 250765245360. Its totient is φ = 42988327488.
The previous prime is 113441420117. The next prime is 113441420207. The reversal of 113441420140 is 41024144311.
113441420140 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 7 ways as a sum of consecutive naturals, for example, 149264647 + ... + 149265406.
It is an arithmetic number, because the mean of its divisors is an integer number (10448551890).
Almost surely, 2113441420140 is an apocalyptic number.
113441420140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113441420140 is an abundant number, since it is smaller than the sum of its proper divisors (137323825220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113441420140 is a wasteful number, since it uses less digits than its factorization.
113441420140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298530081 (or 298530079 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 113441420140 its reverse (41024144311), we get a palindrome (154465564451).
The spelling of 113441420140 in words is "one hundred thirteen billion, four hundred forty-one million, four hundred twenty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •