Base | Representation |
---|---|
bin | 11001101100110011101010… |
… | …111001100100011000010100 |
3 | 112211012120221222012212022102 |
4 | 121230303222321210120110 |
5 | 104303342023340240200 |
6 | 1040221223024221232 |
7 | 32544112132331045 |
oct | 3154635271443024 |
9 | 484176858185272 |
10 | 113030300321300 |
11 | 3301897692381a |
12 | 10816042a6a818 |
13 | 4b0b93347755b |
14 | 1dca9a50da8cc |
15 | d1029e1046d5 |
hex | 66cceae64614 |
113030300321300 has 36 divisors (see below), whose sum is σ = 245299044814656. Its totient is φ = 45207826466400.
The previous prime is 113030300321293. The next prime is 113030300321347. The reversal of 113030300321300 is 3123003030311.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52612412 + ... + 54718611.
Almost surely, 2113030300321300 is an apocalyptic number.
113030300321300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113030300321300 is an abundant number, since it is smaller than the sum of its proper divisors (132268744493356).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113030300321300 is a wasteful number, since it uses less digits than its factorization.
113030300321300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107341568 (or 107341561 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 113030300321300 its reverse (3123003030311), we get a palindrome (116153303351611).
The spelling of 113030300321300 in words is "one hundred thirteen trillion, thirty billion, three hundred million, three hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •