Base | Representation |
---|---|
bin | 111100010001100010100… |
… | …100001000011110010000 |
3 | 112122222020020201102120110 |
4 | 330101202210020132100 |
5 | 1020330310020044100 |
6 | 12450450504041320 |
7 | 605151450022605 |
oct | 74214244103620 |
9 | 15588206642513 |
10 | 4142002112400 |
11 | 1357682235459 |
12 | 56a8b8163240 |
13 | 2407873c4409 |
14 | 10468c8166ac |
15 | 72b2285a250 |
hex | 3c462908790 |
4142002112400 has 120 divisors (see below), whose sum is σ = 13278608489664. Its totient is φ = 1103668544000.
The previous prime is 4142002112359. The next prime is 4142002112431. The reversal of 4142002112400 is 42112002414.
It is a tau number, because it is divible by the number of its divisors (120).
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, 180925 + ... + 2883875.
Almost surely, 24142002112400 is an apocalyptic number.
4142002112400 is a gapful number since it is divisible by the number (40) 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 4142002112400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6639304244832).
4142002112400 is an abundant number, since it is smaller than the sum of its proper divisors (9136606377264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4142002112400 is a wasteful number, since it uses less digits than its factorization.
4142002112400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2704249 (or 2704238 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 4142002112400 its reverse (42112002414), we get a palindrome (4184114114814).
The spelling of 4142002112400 in words is "four trillion, one hundred forty-two billion, two million, one hundred twelve thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •