Base | Representation |
---|---|
bin | 1000010010110010010… |
… | …1111111111101001001 |
3 | 111121202211011120210211 |
4 | 2010230211333331021 |
5 | 4313300403021221 |
6 | 145242205241121 |
7 | 13202560456603 |
oct | 2045445777511 |
9 | 447684146724 |
10 | 142482079561 |
11 | 55476468268 |
12 | 23744b631a1 |
13 | 10588b88723 |
14 | 6c79136173 |
15 | 3a8daac6e1 |
hex | 212c97ff49 |
142482079561 has 12 divisors (see below), whose sum is σ = 150446233524. Its totient is φ = 134919820800.
The previous prime is 142482079547. The next prime is 142482079577. The reversal of 142482079561 is 165970284241.
It can be written as a sum of positive squares in 2 ways, for example, as 107981246025 + 34500833536 = 328605^2 + 185744^2 .
It is not a de Polignac number, because 142482079561 - 29 = 142482079049 is a prime.
It is a super-2 number, since 2×1424820795612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142482079591) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 688801 + ... + 871441.
It is an arithmetic number, because the mean of its divisors is an integer number (12537186127).
Almost surely, 2142482079561 is an apocalyptic number.
It is an amenable number.
142482079561 is a deficient number, since it is larger than the sum of its proper divisors (7964153963).
142482079561 is a wasteful number, since it uses less digits than its factorization.
142482079561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184840 (or 184821 counting only the distinct ones).
The product of its (nonzero) digits is 967680, while the sum is 49.
It can be divided in two parts, 14248 and 2079561, that added together give a square (2093809 = 14472).
The spelling of 142482079561 in words is "one hundred forty-two billion, four hundred eighty-two million, seventy-nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •