Base | Representation |
---|---|
bin | 1000010010100001111… |
… | …1000011110110011000 |
3 | 111121121000110200110212 |
4 | 2010220133003312120 |
5 | 4313130231323030 |
6 | 145231304030252 |
7 | 13201062546554 |
oct | 2045037036630 |
9 | 447530420425 |
10 | 142413151640 |
11 | 55440569741 |
12 | 23725a62388 |
13 | 10577803b86 |
14 | 6c6dd12864 |
15 | 3a879e4595 |
hex | 21287c3d98 |
142413151640 has 32 divisors (see below), whose sum is σ = 320442130080. Its totient is φ = 56963031552.
The previous prime is 142413151631. The next prime is 142413151667. The reversal of 142413151640 is 46151314241.
It is a junction number, because it is equal to n+sod(n) for n = 142413151597 and 142413151606.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1295717 + ... + 1401323.
It is an arithmetic number, because the mean of its divisors is an integer number (10013816565).
Almost surely, 2142413151640 is an apocalyptic number.
142413151640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142413151640 is an abundant number, since it is smaller than the sum of its proper divisors (178028978440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142413151640 is a wasteful number, since it uses less digits than its factorization.
142413151640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139331 (or 139327 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 142413151640 its reverse (46151314241), we get a palindrome (188564465881).
The spelling of 142413151640 in words is "one hundred forty-two billion, four hundred thirteen million, one hundred fifty-one thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •