Base | Representation |
---|---|
bin | 11100010000101001111… |
… | …001100001011000000000 |
3 | 20212122201021121101012201 |
4 | 130100221321201120000 |
5 | 223304233202200220 |
6 | 4044053323202544 |
7 | 260210161005523 |
oct | 34205171413000 |
9 | 6778637541181 |
10 | 1942028162560 |
11 | 6896782a6332 |
12 | 274465376454 |
13 | 111195062095 |
14 | 69dcd506bba |
15 | 357b3851d0a |
hex | 1c429e61600 |
1942028162560 has 120 divisors (see below), whose sum is σ = 4811371079328. Its totient is φ = 751751884800.
The previous prime is 1942028162549. The next prime is 1942028162593. The reversal of 1942028162560 is 652618202491.
It is a self number, because there is not a number n which added to its sum of digits gives 1942028162560.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2065465 + ... + 2854855.
Almost surely, 21942028162560 is an apocalyptic number.
1942028162560 is a gapful number since it is divisible by the number (10) 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 1942028162560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2405685539664).
1942028162560 is an abundant number, since it is smaller than the sum of its proper divisors (2869342916768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1942028162560 is an frugal number, since it uses more digits than its factorization.
1942028162560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 789476 (or 789429 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 46.
The spelling of 1942028162560 in words is "one trillion, nine hundred forty-two billion, twenty-eight million, one hundred sixty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •