Base | Representation |
---|---|
bin | 110100101011111001… |
… | …1001000000110000110 |
3 | 101211001001221202021101 |
4 | 1221113303020012012 |
5 | 3323203343414430 |
6 | 123550553210314 |
7 | 11113524401623 |
oct | 1512763100606 |
9 | 354031852241 |
10 | 113142169990 |
11 | 43a8a894a13 |
12 | 19b1710099a |
13 | a89149b3a5 |
14 | 569463734a |
15 | 2e22dc0dca |
hex | 1a57cc8186 |
113142169990 has 24 divisors (see below), whose sum is σ = 206564790960. Its totient is φ = 44619427440.
The previous prime is 113142169897. The next prime is 113142169991. The reversal of 113142169990 is 99961241311.
It is a self number, because there is not a number n which added to its sum of digits gives 113142169990.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113142169991) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1071810 + ... + 1172629.
It is an arithmetic number, because the mean of its divisors is an integer number (8606866290).
Almost surely, 2113142169990 is an apocalyptic number.
113142169990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113142169990 is a deficient number, since it is larger than the sum of its proper divisors (93422620970).
113142169990 is an equidigital number, since it uses as much as digits as its factorization.
113142169990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2244588 (or 2244517 counting only the distinct ones).
The product of its (nonzero) digits is 104976, while the sum is 46.
The spelling of 113142169990 in words is "one hundred thirteen billion, one hundred forty-two million, one hundred sixty-nine thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •