Base | Representation |
---|---|
bin | 110100101011111001… |
… | …0100001100001100000 |
3 | 101211001001122201112220 |
4 | 1221113302201201200 |
5 | 3323203323341000 |
6 | 123550545551040 |
7 | 11113523143203 |
oct | 1512762414140 |
9 | 354031581486 |
10 | 113142012000 |
11 | 43a8a797246 |
12 | 19b17045480 |
13 | a8914444c4 |
14 | 56945d593a |
15 | 2e22d8e1a0 |
hex | 1a57ca1860 |
113142012000 has 96 divisors (see below), whose sum is σ = 370653270624. Its totient is φ = 30171200000.
The previous prime is 113142011971. The next prime is 113142012023. The reversal of 113142012000 is 210241311.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×1131420120002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
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, 4702251 + ... + 4726250.
It is an arithmetic number, because the mean of its divisors is an integer number (3860971569).
Almost surely, 2113142012000 is an apocalyptic number.
113142012000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113142012000 is an abundant number, since it is smaller than the sum of its proper divisors (257511258624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113142012000 is an equidigital number, since it uses as much as digits as its factorization.
113142012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9428529 (or 9428511 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 113142012000 its reverse (210241311), we get a palindrome (113352253311).
The spelling of 113142012000 in words is "one hundred thirteen billion, one hundred forty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •