Base | Representation |
---|---|
bin | 100111001111001010… |
… | …110011011000110100 |
3 | 11000202010211011010002 |
4 | 213033022303120310 |
5 | 1142240341440200 |
6 | 31204321050432 |
7 | 3021013446422 |
oct | 471712633064 |
9 | 130663734102 |
10 | 42130421300 |
11 | 1695a585100 |
12 | 81b9486a18 |
13 | 3c85562096 |
14 | 20794d6112 |
15 | 1168a5cbd5 |
hex | 9cf2b3634 |
42130421300 has 108 divisors (see below), whose sum is σ = 100763217408. Its totient is φ = 15278472000.
The previous prime is 42130421299. The next prime is 42130421303. The reversal of 42130421300 is 312403124.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42130421303) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 4629755 + ... + 4638845.
Almost surely, 242130421300 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 42130421300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50381608704).
42130421300 is an abundant number, since it is smaller than the sum of its proper divisors (58632796108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42130421300 is a wasteful number, since it uses less digits than its factorization.
42130421300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9510 (or 9492 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 42130421300 its reverse (312403124), we get a palindrome (42442824424).
The spelling of 42130421300 in words is "forty-two billion, one hundred thirty million, four hundred twenty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •