Base | Representation |
---|---|
bin | 1000010011001010100… |
… | …0011111110101000000 |
3 | 111122000212211002011100 |
4 | 2010302220133311000 |
5 | 4314002322211241 |
6 | 145300225014400 |
7 | 13205230612005 |
oct | 2046250376500 |
9 | 448025732140 |
10 | 142583397696 |
11 | 5551867a063 |
12 | 23772a84400 |
13 | 105a3b7119c |
14 | 6c8878b8ac |
15 | 3a979229b6 |
hex | 2132a1fd40 |
142583397696 has 168 divisors, whose sum is σ = 436934481984. Its totient is φ = 44297441280.
The previous prime is 142583397661. The next prime is 142583397701. The reversal of 142583397696 is 696793385241.
142583397696 is a `hidden beast` number, since 1 + 42 + 583 + 3 + 9 + 7 + 6 + 9 + 6 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 937891 + ... + 1079261.
It is an arithmetic number, because the mean of its divisors is an integer number (2600800488).
Almost surely, 2142583397696 is an apocalyptic number.
142583397696 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 142583397696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (218467240992).
142583397696 is an abundant number, since it is smaller than the sum of its proper divisors (294351084288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142583397696 is a wasteful number, since it uses less digits than its factorization.
142583397696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141509 (or 141496 counting only the distinct ones).
The product of its digits is 58786560, while the sum is 63.
The spelling of 142583397696 in words is "one hundred forty-two billion, five hundred eighty-three million, three hundred ninety-seven thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •