Base | Representation |
---|---|
bin | 100111001000000111… |
… | …100111001010101100 |
3 | 11000102220021001120110 |
4 | 213020013213022230 |
5 | 1142020102104200 |
6 | 31144454020020 |
7 | 3015046222500 |
oct | 471007471254 |
9 | 130386231513 |
10 | 42012144300 |
11 | 168a983a915 |
12 | 8185947610 |
13 | 3c66bbc4a9 |
14 | 2067908300 |
15 | 115d497b50 |
hex | 9c81e72ac |
42012144300 has 216 divisors, whose sum is σ = 142357294800. Its totient is φ = 9537830400.
The previous prime is 42012144289. The next prime is 42012144331. The reversal of 42012144300 is 344121024.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2180710 + ... + 2199890.
It is an arithmetic number, because the mean of its divisors is an integer number (659061550).
Almost surely, 242012144300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42012144300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71178647400).
42012144300 is an abundant number, since it is smaller than the sum of its proper divisors (100345150500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42012144300 is a wasteful number, since it uses less digits than its factorization.
42012144300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19361 (or 19347 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 42012144300 its reverse (344121024), we get a palindrome (42356265324).
The spelling of 42012144300 in words is "forty-two billion, twelve million, one hundred forty-four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •