Base | Representation |
---|---|
bin | 10011010010101111000110… |
… | …01000011011011001100000 |
3 | 12120012210212022111222110202 |
4 | 21221113203020123121200 |
5 | 21030043303332320000 |
6 | 230121511413044332 |
7 | 11636056033143044 |
oct | 1151274310333140 |
9 | 176183768458422 |
10 | 42425202620000 |
11 | 12577477946722 |
12 | 49123566266a8 |
13 | 1a898aa967365 |
14 | a6956837a024 |
15 | 4d889be8add5 |
hex | 2695e321b660 |
42425202620000 has 120 divisors (see below), whose sum is σ = 104523441660792. Its totient is φ = 16945516800000.
The previous prime is 42425202619909. The next prime is 42425202620069. The reversal of 42425202620000 is 2620252424.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 12285080 + ... + 15354920.
Almost surely, 242425202620000 is an apocalyptic number.
42425202620000 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 42425202620000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52261720830396).
42425202620000 is an abundant number, since it is smaller than the sum of its proper divisors (62098239040792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42425202620000 is an equidigital number, since it uses as much as digits as its factorization.
42425202620000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3070562 (or 3070539 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 29.
Adding to 42425202620000 its reverse (2620252424), we get a palindrome (42427822872424).
The spelling of 42425202620000 in words is "forty-two trillion, four hundred twenty-five billion, two hundred two million, six hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •