Base | Representation |
---|---|
bin | 1000011100101100100… |
… | …1010101010001010000 |
3 | 111212122012112202112002 |
4 | 2013023021111101100 |
5 | 4334222342021112 |
6 | 150402151453132 |
7 | 13325520565016 |
oct | 2071311252120 |
9 | 455565482462 |
10 | 145142142032 |
11 | 56610a565a8 |
12 | 241679871a8 |
13 | 108c0ccaba4 |
14 | 704c5308b6 |
15 | 3b973a41c2 |
hex | 21cb255450 |
145142142032 has 40 divisors (see below), whose sum is σ = 283844321640. Its totient is φ = 71895121920.
The previous prime is 145142142031. The next prime is 145142142077. The reversal of 145142142032 is 230241241541.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 7824463936 + 137317678096 = 88456^2 + 370564^2 .
It is a super-2 number, since 2×1451421420322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 145142141986 and 145142142004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145142142031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 646694 + ... + 841722.
It is an arithmetic number, because the mean of its divisors is an integer number (7096108041).
Almost surely, 2145142142032 is an apocalyptic number.
It is an amenable number.
145142142032 is a deficient number, since it is larger than the sum of its proper divisors (138702179608).
145142142032 is a wasteful number, since it uses less digits than its factorization.
145142142032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195471 (or 195465 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 145142142032 its reverse (230241241541), we get a palindrome (375383383573).
The spelling of 145142142032 in words is "one hundred forty-five billion, one hundred forty-two million, one hundred forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •