Base | Representation |
---|---|
bin | 10100111111000111110… |
… | …100110000111111011100 |
3 | 12002212111001210002021202 |
4 | 110333013310300333130 |
5 | 142112024113323200 |
6 | 3022304442015032 |
7 | 206123142230501 |
oct | 24770764607734 |
9 | 5085431702252 |
10 | 1442166542300 |
11 | 50668a463660 |
12 | 1b36027a7478 |
13 | a5cc37a5013 |
14 | 4db308254a8 |
15 | 277a9e551d5 |
hex | 14fc7d30fdc |
1442166542300 has 144 divisors (see below), whose sum is σ = 3424289081472. Its totient is φ = 522846777600.
The previous prime is 1442166542263. The next prime is 1442166542363. The reversal of 1442166542300 is 32456612441.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 865126067 + ... + 865127733.
It is an arithmetic number, because the mean of its divisors is an integer number (23779785288).
Almost surely, 21442166542300 is an apocalyptic number.
1442166542300 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 1442166542300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1712144540736).
1442166542300 is an abundant number, since it is smaller than the sum of its proper divisors (1982122539172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1442166542300 is a wasteful number, since it uses less digits than its factorization.
1442166542300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3588 (or 3581 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 1442166542300 in words is "one trillion, four hundred forty-two billion, one hundred sixty-six million, five hundred forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •