Base | Representation |
---|---|
bin | 11001110100001110011110… |
… | …110100011111111001001100 |
3 | 112220000022220112100120222110 |
4 | 121310032132310133321030 |
5 | 104340220134002011022 |
6 | 1041251340253144020 |
7 | 32626001100014040 |
oct | 3164163664377114 |
9 | 486008815316873 |
10 | 113540125032012 |
11 | 331a5107660848 |
12 | 10898a0618b010 |
13 | 4b47a31b9ab03 |
14 | 200752b094020 |
15 | d1d68c51d00c |
hex | 67439ed1fe4c |
113540125032012 has 96 divisors (see below), whose sum is σ = 330925298135040. Its totient is φ = 29546901596160.
The previous prime is 113540125032011. The next prime is 113540125032053. The reversal of 113540125032012 is 210230521045311.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (113540125032011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1282373337 + ... + 1282461872.
It is an arithmetic number, because the mean of its divisors is an integer number (3447138522240).
Almost surely, 2113540125032012 is an apocalyptic number.
113540125032012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113540125032012 is an abundant number, since it is smaller than the sum of its proper divisors (217385173103028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113540125032012 is a wasteful number, since it uses less digits than its factorization.
113540125032012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2564835271 (or 2564835269 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 113540125032012 its reverse (210230521045311), we get a palindrome (323770646077323).
The spelling of 113540125032012 in words is "one hundred thirteen trillion, five hundred forty billion, one hundred twenty-five million, thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •