Base | Representation |
---|---|
bin | 110100101000010000… |
… | …1001111100001011110 |
3 | 101210201120010222012221 |
4 | 1221100201033201132 |
5 | 3322431112310220 |
6 | 123530511415554 |
7 | 11110512333421 |
oct | 1512041174136 |
9 | 353646128187 |
10 | 113020041310 |
11 | 43a27959920 |
12 | 19aa22245ba |
13 | a8720aa5b7 |
14 | 56823259b8 |
15 | 2e172e99aa |
hex | 1a5084f85e |
113020041310 has 96 divisors (see below), whose sum is σ = 229025304576. Its totient is φ = 39806928000.
The previous prime is 113020041289. The next prime is 113020041319. The reversal of 113020041310 is 13140020311.
It is a super-2 number, since 2×1130200413102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113020041319) 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 47 ways as a sum of consecutive naturals, for example, 52738099 + ... + 52740241.
It is an arithmetic number, because the mean of its divisors is an integer number (2385680256).
Almost surely, 2113020041310 is an apocalyptic number.
113020041310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113020041310 is an abundant number, since it is smaller than the sum of its proper divisors (116005263266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113020041310 is a wasteful number, since it uses less digits than its factorization.
113020041310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2410 (or 2309 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 113020041310 its reverse (13140020311), we get a palindrome (126160061621).
The spelling of 113020041310 in words is "one hundred thirteen billion, twenty million, forty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •