Base | Representation |
---|---|
bin | 110000001110000010100001… |
… | …1001101111010110101001000 |
3 | 2001121202120201112202121010110 |
4 | 1200130011003031322311020 |
5 | 421043120340433313300 |
6 | 4102024054325314320 |
7 | 155224151655306225 |
oct | 14034050315726510 |
9 | 2047676645677113 |
10 | 424142033104200 |
11 | 113165698366744 |
12 | 3b6a16988659a0 |
13 | 15288564487428 |
14 | 76a482646894c |
15 | 3407d933e2550 |
hex | 181c14337ad48 |
424142033104200 has 96 divisors (see below), whose sum is σ = 1316872514496960. Its totient is φ = 112929728236800.
The previous prime is 424142033104169. The next prime is 424142033104213. The reversal of 424142033104200 is 2401330241424.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 545904991 + ... + 546681390.
It is an arithmetic number, because the mean of its divisors is an integer number (13717422026010).
Almost surely, 2424142033104200 is an apocalyptic number.
424142033104200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
424142033104200 is an abundant number, since it is smaller than the sum of its proper divisors (892730481392760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
424142033104200 is a wasteful number, since it uses less digits than its factorization.
424142033104200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1092587047 (or 1092587038 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 424142033104200 its reverse (2401330241424), we get a palindrome (426543363345624).
The spelling of 424142033104200 in words is "four hundred twenty-four trillion, one hundred forty-two billion, thirty-three million, one hundred four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •