Base | Representation |
---|---|
bin | 110100001001111011… |
… | …1101000111100101000 |
3 | 101201002122110122022010 |
4 | 1220103313220330220 |
5 | 3313340120034230 |
6 | 123241522155520 |
7 | 11043345363663 |
oct | 1502367507450 |
9 | 351078418263 |
10 | 112002502440 |
11 | 43555546904 |
12 | 198594b2ba0 |
13 | a73c33c2aa |
14 | 55c71306da |
15 | 2da7d019b0 |
hex | 1a13de8f28 |
112002502440 has 32 divisors (see below), whose sum is σ = 336007507680. Its totient is φ = 29867333952.
The previous prime is 112002502427. The next prime is 112002502459. The reversal of 112002502440 is 44205200211.
112002502440 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 466676974 + ... + 466677213.
It is an arithmetic number, because the mean of its divisors is an integer number (10500234615).
Almost surely, 2112002502440 is an apocalyptic number.
112002502440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112002502440 is an abundant number, since it is smaller than the sum of its proper divisors (224005005240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002502440 is a wasteful number, since it uses less digits than its factorization.
112002502440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 933354201 (or 933354197 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 21.
Adding to 112002502440 its reverse (44205200211), we get a palindrome (156207702651).
The spelling of 112002502440 in words is "one hundred twelve billion, two million, five hundred two thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •