Base | Representation |
---|---|
bin | 11001011111010011001000… |
… | …100011101001000011100000 |
3 | 112200220211212220111010112012 |
4 | 121133103020203221003200 |
5 | 104143134404332241000 |
6 | 1034230541503052052 |
7 | 32420050225153145 |
oct | 3137231043510340 |
9 | 480824786433465 |
10 | 112102011212000 |
11 | 327a0217921457 |
12 | 106a61548a1028 |
13 | 4a72235c16a24 |
14 | 1d97aa29c83cc |
15 | ce606d2a4735 |
hex | 65f4c88e90e0 |
112102011212000 has 48 divisors (see below), whose sum is σ = 275434641557712. Its totient is φ = 44840804483200.
The previous prime is 112102011211969. The next prime is 112102011212003. The reversal of 112102011212000 is 212110201211.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112102011212003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14012747402 + ... + 14012755401.
It is an arithmetic number, because the mean of its divisors is an integer number (5738221699119).
Almost surely, 2112102011212000 is an apocalyptic number.
112102011212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112102011212000 is an abundant number, since it is smaller than the sum of its proper divisors (163332630345712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102011212000 is an equidigital number, since it uses as much as digits as its factorization.
112102011212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28025502828 (or 28025502810 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112102011212000 its reverse (212110201211), we get a palindrome (112314121413211).
The spelling of 112102011212000 in words is "one hundred twelve trillion, one hundred two billion, eleven million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •