Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0110100110111010000 |
3 | 101201010020211121212001 |
4 | 1220110120310313100 |
5 | 3313344331431000 |
6 | 123242432443344 |
7 | 11043512336065 |
oct | 1502430646720 |
9 | 351106747761 |
10 | 112011202000 |
11 | 4355a448a25 |
12 | 198603a9554 |
13 | a741096c69 |
14 | 55c8356c6c |
15 | 2da896e46a |
hex | 1a14634dd0 |
112011202000 has 40 divisors (see below), whose sum is σ = 270843091272. Its totient is φ = 44804480000.
The previous prime is 112011201997. The next prime is 112011202001. The reversal of 112011202000 is 202110211.
It can be written as a sum of positive squares in 4 ways, for example, as 11209104 + 111999992896 = 3348^2 + 334664^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011202001) 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, 28000801 + ... + 28004800.
Almost surely, 2112011202000 is an apocalyptic number.
112011202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112011202000 is an abundant number, since it is smaller than the sum of its proper divisors (158831889272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011202000 is an equidigital number, since it uses as much as digits as its factorization.
112011202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56005624 (or 56005608 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 112011202000 its reverse (202110211), we get a palindrome (112213312211).
The spelling of 112011202000 in words is "one hundred twelve billion, eleven million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •