Base | Representation |
---|---|
bin | 1000010001100010010… |
… | …0101110011111011000 |
3 | 111120220102011012210212 |
4 | 2010120210232133120 |
5 | 4312103411422220 |
6 | 145145010230252 |
7 | 13161341530466 |
oct | 2043044563730 |
9 | 446812135725 |
10 | 142146201560 |
11 | 55313909140 |
12 | 23670585388 |
13 | 1053440834c |
14 | 6c466a3836 |
15 | 3a6e3630c5 |
hex | 211892e7d8 |
142146201560 has 64 divisors (see below), whose sum is σ = 349143091200. Its totient is φ = 51654153600.
The previous prime is 142146201481. The next prime is 142146201563. The reversal of 142146201560 is 65102641241.
It is a super-2 number, since 2×1421462015602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142146201563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 537431 + ... + 757049.
It is an arithmetic number, because the mean of its divisors is an integer number (5455360800).
Almost surely, 2142146201560 is an apocalyptic number.
142146201560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
142146201560 is an abundant number, since it is smaller than the sum of its proper divisors (206996889640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142146201560 is a wasteful number, since it uses less digits than its factorization.
142146201560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 221112 (or 221108 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 142146201560 in words is "one hundred forty-two billion, one hundred forty-six million, two hundred one thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •