Base | Representation |
---|---|
bin | 11001110000111000010000… |
… | …010101010101100110001100 |
3 | 112212012100011202222211122110 |
4 | 121300320100111111212030 |
5 | 104322433041403411022 |
6 | 1040553535240544020 |
7 | 32603245636664316 |
oct | 3160702025254614 |
9 | 485170152884573 |
10 | 113310101232012 |
11 | 331165a91802a3 |
12 | 1086030b782010 |
13 | 4b2c1345a2909 |
14 | 1dda3497307b6 |
15 | d176c831d00c |
hex | 670e1055598c |
113310101232012 has 48 divisors (see below), whose sum is σ = 264453130345824. Its totient is φ = 37761049920000.
The previous prime is 113310101231959. The next prime is 113310101232043. The reversal of 113310101232012 is 210232101013311.
It is a self number, because there is not a number n which added to its sum of digits gives 113310101232012.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1008390712 + ... + 1008503072.
It is an arithmetic number, because the mean of its divisors is an integer number (5509440215538).
Almost surely, 2113310101232012 is an apocalyptic number.
113310101232012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113310101232012 is an abundant number, since it is smaller than the sum of its proper divisors (151143029113812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113310101232012 is a wasteful number, since it uses less digits than its factorization.
113310101232012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131610 (or 131608 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 113310101232012 its reverse (210232101013311), we get a palindrome (323542202245323).
The spelling of 113310101232012 in words is "one hundred thirteen trillion, three hundred ten billion, one hundred one million, two hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •