Base | Representation |
---|---|
bin | 110100101110110110… |
… | …0010010110101001010 |
3 | 101211021221222222111221 |
4 | 1221131230102311022 |
5 | 3323404201323000 |
6 | 124004444312254 |
7 | 11116134656140 |
oct | 1513554226512 |
9 | 354257888457 |
10 | 113241042250 |
11 | 44030686126 |
12 | 19b4424268a |
13 | a8a8b0879b |
14 | 56a3813590 |
15 | 2e2b90161a |
hex | 1a5db12d4a |
113241042250 has 64 divisors (see below), whose sum is σ = 244179247104. Its totient is φ = 38519712000.
The previous prime is 113241042217. The next prime is 113241042251. The reversal of 113241042250 is 52240142311.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (113241042251) by changing a digit.
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, 32511 + ... + 477010.
It is an arithmetic number, because the mean of its divisors is an integer number (3815300736).
Almost surely, 2113241042250 is an apocalyptic number.
113241042250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113241042250 is an abundant number, since it is smaller than the sum of its proper divisors (130938204854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113241042250 is a wasteful number, since it uses less digits than its factorization.
113241042250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 509672 (or 509662 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 113241042250 its reverse (52240142311), we get a palindrome (165481184561).
The spelling of 113241042250 in words is "one hundred thirteen billion, two hundred forty-one million, forty-two thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •