Base | Representation |
---|---|
bin | 1000010001100011010… |
… | …0110000100101010000 |
3 | 111120220201001202001210 |
4 | 2010120310300211100 |
5 | 4312111000420212 |
6 | 145145240300120 |
7 | 13161422333661 |
oct | 2043064604520 |
9 | 446821052053 |
10 | 142150404432 |
11 | 55316219893 |
12 | 23671a71640 |
13 | 1053524a35a |
14 | 6c47079368 |
15 | 3a6e8e353c |
hex | 2118d30950 |
142150404432 has 80 divisors (see below), whose sum is σ = 393745155840. Its totient is φ = 44031676416.
The previous prime is 142150404419. The next prime is 142150404469. The reversal of 142150404432 is 234404051241.
It is a self number, because there is not a number n which added to its sum of digits gives 142150404432.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1038093 + ... + 1167020.
It is an arithmetic number, because the mean of its divisors is an integer number (4921814448).
Almost surely, 2142150404432 is an apocalyptic number.
142150404432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
142150404432 is an abundant number, since it is smaller than the sum of its proper divisors (251594751408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142150404432 is a wasteful number, since it uses less digits than its factorization.
142150404432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2205220 (or 2205214 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 142150404432 its reverse (234404051241), we get a palindrome (376554455673).
The spelling of 142150404432 in words is "one hundred forty-two billion, one hundred fifty million, four hundred four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •