Base | Representation |
---|---|
bin | 11001101111010010101011… |
… | …001111011101011011010000 |
3 | 112211210220122111010110220011 |
4 | 121233102223033131123100 |
5 | 104314141202414310000 |
6 | 1040431500303324304 |
7 | 32562335035255003 |
oct | 3157225317353320 |
9 | 484726574113804 |
10 | 113201031010000 |
11 | 3308431895114a |
12 | 108431502b0694 |
13 | 4b21a718c72cb |
14 | 1dd4d5dc1953a |
15 | d14942b852ba |
hex | 66f4ab3dd6d0 |
113201031010000 has 50 divisors (see below), whose sum is σ = 274071016202522. Its totient is φ = 45280412400000.
The previous prime is 113201031009977. The next prime is 113201031010087. The reversal of 113201031010000 is 10130102311.
It can be written as a sum of positive squares in 5 ways, for example, as 43733673564736 + 69467357445264 = 6613144^2 + 8334708^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 5660041551 + ... + 5660061550.
Almost surely, 2113201031010000 is an apocalyptic number.
113201031010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113201031010000 is an abundant number, since it is smaller than the sum of its proper divisors (160869985192522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113201031010000 is an equidigital number, since it uses as much as digits as its factorization.
113201031010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11320103129 (or 11320103108 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 113201031010000 its reverse (10130102311), we get a palindrome (113211161112311).
The spelling of 113201031010000 in words is "one hundred thirteen trillion, two hundred one billion, thirty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •