Base | Representation |
---|---|
bin | 110100101000010011… |
… | …0111001010010011100 |
3 | 101210201122221020212001 |
4 | 1221100212321102130 |
5 | 3322432002214400 |
6 | 123531003252044 |
7 | 11110531044463 |
oct | 1512046712234 |
9 | 353648836761 |
10 | 113021523100 |
11 | 43a28781142 |
12 | 19aa281a024 |
13 | a8724a8bb5 |
14 | 56825cd9da |
15 | 2e174dda6a |
hex | 1a509b949c |
113021523100 has 36 divisors (see below), whose sum is σ = 253713839400. Its totient is φ = 43649690560.
The previous prime is 113021523091. The next prime is 113021523127. The reversal of 113021523100 is 1325120311.
It is a super-2 number, since 2×1130215231002 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 19483570 + ... + 19489369.
It is an arithmetic number, because the mean of its divisors is an integer number (7047606650).
Almost surely, 2113021523100 is an apocalyptic number.
113021523100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113021523100 is an abundant number, since it is smaller than the sum of its proper divisors (140692316300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113021523100 is a wasteful number, since it uses less digits than its factorization.
113021523100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38972982 (or 38972975 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 19.
Adding to 113021523100 its reverse (1325120311), we get a palindrome (114346643411).
The spelling of 113021523100 in words is "one hundred thirteen billion, twenty-one million, five hundred twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •