Base | Representation |
---|---|
bin | 110100101011111111… |
… | …0010100010010001100 |
3 | 101211001021110210021220 |
4 | 1221113332110102030 |
5 | 3323210121303000 |
6 | 123551140123340 |
7 | 11113561340262 |
oct | 1512776242214 |
9 | 354037423256 |
10 | 113145103500 |
11 | 43a91508a00 |
12 | 19b18096550 |
13 | a891c876b0 |
14 | 5694b9c432 |
15 | 2e232a01a0 |
hex | 1a57f9448c |
113145103500 has 576 divisors, whose sum is σ = 395599626240. Its totient is φ = 24957504000.
The previous prime is 113145103499. The next prime is 113145103549. The reversal of 113145103500 is 5301541311.
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 191 ways as a sum of consecutive naturals, for example, 186400197 + ... + 186400803.
Almost surely, 2113145103500 is an apocalyptic number.
113145103500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113145103500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197799813120).
113145103500 is an abundant number, since it is smaller than the sum of its proper divisors (282454522740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113145103500 is a wasteful number, since it uses less digits than its factorization.
113145103500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 743 (or 720 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
Adding to 113145103500 its reverse (5301541311), we get a palindrome (118446644811).
The spelling of 113145103500 in words is "one hundred thirteen billion, one hundred forty-five million, one hundred three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •