Base | Representation |
---|---|
bin | 1000010001000100011… |
… | …0000110111101010001 |
3 | 111120120200001211202212 |
4 | 2010101012012331101 |
5 | 4311324302003201 |
6 | 145124325121505 |
7 | 13155256220261 |
oct | 2042106067521 |
9 | 446520054685 |
10 | 142020734801 |
11 | 5525a003100 |
12 | 23636559295 |
13 | 1051441906a |
14 | 6c33b637a1 |
15 | 3a6332cabb |
hex | 2111186f51 |
142020734801 has 12 divisors (see below), whose sum is σ = 159912891012. Its totient is φ = 125960736000.
The previous prime is 142020734797. The next prime is 142020734803. The reversal of 142020734801 is 108437020241.
It can be written as a sum of positive squares in 2 ways, for example, as 68199844801 + 73820890000 = 261151^2 + 271700^2 .
It is not a de Polignac number, because 142020734801 - 22 = 142020734797 is a prime.
It is a super-2 number, since 2×1420207348012 (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 (142020734803) 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, 14308760 + ... + 14318681.
It is an arithmetic number, because the mean of its divisors is an integer number (13326074251).
Almost surely, 2142020734801 is an apocalyptic number.
142020734801 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142020734801 is a deficient number, since it is larger than the sum of its proper divisors (17892156211).
142020734801 is a wasteful number, since it uses less digits than its factorization.
142020734801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28627504 (or 28627493 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 32.
The spelling of 142020734801 in words is "one hundred forty-two billion, twenty million, seven hundred thirty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •