Base | Representation |
---|---|
bin | 110100101010001001… |
… | …0001100111101111001 |
3 | 101210212222000011000010 |
4 | 1221110102030331321 |
5 | 3323043300120140 |
6 | 123541045332133 |
7 | 11112210255510 |
oct | 1512422147571 |
9 | 353788004003 |
10 | 113083207545 |
11 | 43a5a582620 |
12 | 19abb407049 |
13 | a8821c5779 |
14 | 568a889677 |
15 | 2e1cb25880 |
hex | 1a5448cf79 |
113083207545 has 64 divisors (see below), whose sum is σ = 238848362496. Its totient is φ = 44231162880.
The previous prime is 113083207529. The next prime is 113083207547. The reversal of 113083207545 is 545702380311.
It is a happy number.
It is not a de Polignac number, because 113083207545 - 24 = 113083207529 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113083207547) 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 63 ways as a sum of consecutive naturals, for example, 2859999 + ... + 2899268.
It is an arithmetic number, because the mean of its divisors is an integer number (3732005664).
Almost surely, 2113083207545 is an apocalyptic number.
113083207545 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
113083207545 is an abundant number, since it is smaller than the sum of its proper divisors (125765154951).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113083207545 is a wasteful number, since it uses less digits than its factorization.
113083207545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5759310.
The product of its (nonzero) digits is 100800, while the sum is 39.
Adding to 113083207545 its reverse (545702380311), we get a palindrome (658785587856).
The spelling of 113083207545 in words is "one hundred thirteen billion, eighty-three million, two hundred seven thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •