Base | Representation |
---|---|
bin | 111100010001110101101… |
… | …100101001100100001000 |
3 | 112200000001121201220111221 |
4 | 330101311230221210020 |
5 | 1020331434204042300 |
6 | 12450542412131424 |
7 | 605162425334230 |
oct | 74216554514410 |
9 | 15600047656457 |
10 | 4142323112200 |
11 | 1357827452349 |
12 | 56a987766b74 |
13 | 240808a65720 |
14 | 1046bd2d4cc0 |
15 | 72b40b1631a |
hex | 3c475b29908 |
4142323112200 has 192 divisors, whose sum is σ = 12235786859520. Its totient is φ = 1268687232000.
The previous prime is 4142323112167. The next prime is 4142323112227. The reversal of 4142323112200 is 22113232414.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3106771 + ... + 4235170.
It is an arithmetic number, because the mean of its divisors is an integer number (63728056560).
Almost surely, 24142323112200 is an apocalyptic number.
4142323112200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4142323112200 is an abundant number, since it is smaller than the sum of its proper divisors (8093463747320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4142323112200 is a wasteful number, since it uses less digits than its factorization.
4142323112200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7342008 (or 7341999 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 4142323112200 its reverse (22113232414), we get a palindrome (4164436344614).
The spelling of 4142323112200 in words is "four trillion, one hundred forty-two billion, three hundred twenty-three million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •