Base | Representation |
---|---|
bin | 1000010001100010000… |
… | …1011111100110100000 |
3 | 111120220100120011101002 |
4 | 2010120201133212200 |
5 | 4312103202313034 |
6 | 145144540131132 |
7 | 13161331401053 |
oct | 2043041374640 |
9 | 446810504332 |
10 | 142145354144 |
11 | 5531338a4a2 |
12 | 23670236aa8 |
13 | 1053419c711 |
14 | 6c46522a9a |
15 | 3a6e246e7e |
hex | 211885f9a0 |
142145354144 has 96 divisors (see below), whose sum is σ = 294974220240. Its totient is φ = 67336192000.
The previous prime is 142145354129. The next prime is 142145354171. The reversal of 142145354144 is 441453541241.
It can be written as a sum of positive squares in 8 ways, for example, as 105227574544 + 36917779600 = 324388^2 + 192140^2 .
It is a junction number, because it is equal to n+sod(n) for n = 142145354098 and 142145354107.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10584554 + ... + 10597974.
Almost surely, 2142145354144 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142145354144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147487110120).
142145354144 is an abundant number, since it is smaller than the sum of its proper divisors (152828866096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142145354144 is a wasteful number, since it uses less digits than its factorization.
142145354144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13674 (or 13666 counting only the distinct ones).
The product of its digits is 153600, while the sum is 38.
Adding to 142145354144 its reverse (441453541241), we get a palindrome (583598895385).
The spelling of 142145354144 in words is "one hundred forty-two billion, one hundred forty-five million, three hundred fifty-four thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •