Base | Representation |
---|---|
bin | 1000010010011111101… |
… | …0001111110000111000 |
3 | 111121120100022101102220 |
4 | 2010213322033300320 |
5 | 4313120244013422 |
6 | 145230321124040 |
7 | 13200614534115 |
oct | 2044772176070 |
9 | 447510271386 |
10 | 142403501112 |
11 | 554360780a4 |
12 | 23722789620 |
13 | 105758053c2 |
14 | 6c6c91d90c |
15 | 3a86c39e5c |
hex | 2127e8fc38 |
142403501112 has 32 divisors (see below), whose sum is σ = 376950445200. Its totient is φ = 44675608064.
The previous prime is 142403501021. The next prime is 142403501131. The reversal of 142403501112 is 211105304241.
142403501112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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, 174513687 + ... + 174514502.
Almost surely, 2142403501112 is an apocalyptic number.
142403501112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
142403501112 is an abundant number, since it is smaller than the sum of its proper divisors (234546944088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142403501112 is a wasteful number, since it uses less digits than its factorization.
142403501112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349028215 (or 349028211 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 142403501112 its reverse (211105304241), we get a palindrome (353508805353).
The spelling of 142403501112 in words is "one hundred forty-two billion, four hundred three million, five hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •