Base | Representation |
---|---|
bin | 110100101000100011… |
… | …1010101000101001110 |
3 | 101210202020221020000121 |
4 | 1221101013111011032 |
5 | 3322441141304200 |
6 | 123531505415154 |
7 | 11110663236121 |
oct | 1512107250516 |
9 | 353666836017 |
10 | 113030025550 |
11 | 43a32559162 |
12 | 19aa563a4ba |
13 | a874194c30 |
14 | 56837a43b8 |
15 | 2e1811ce1a |
hex | 1a511d514e |
113030025550 has 24 divisors (see below), whose sum is σ = 226407837096. Its totient is φ = 41734163040.
The previous prime is 113030025541. The next prime is 113030025557. The reversal of 113030025550 is 55520030311.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113030025557) 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 11 ways as a sum of consecutive naturals, for example, 86945524 + ... + 86946823.
It is an arithmetic number, because the mean of its divisors is an integer number (9433659879).
Almost surely, 2113030025550 is an apocalyptic number.
113030025550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113030025550 is an abundant number, since it is smaller than the sum of its proper divisors (113377811546).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113030025550 is a wasteful number, since it uses less digits than its factorization.
113030025550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173892372 (or 173892367 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
Adding to 113030025550 its reverse (55520030311), we get a palindrome (168550055861).
The spelling of 113030025550 in words is "one hundred thirteen billion, thirty million, twenty-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •