Base | Representation |
---|---|
bin | 10011001101000101111110… |
… | …01100110001100011000000 |
3 | 12112112021102201220222202220 |
4 | 21212202333030301203000 |
5 | 21013404224010014300 |
6 | 225452445313411040 |
7 | 11616053430201162 |
oct | 1146427714614300 |
9 | 175467381828686 |
10 | 42231326251200 |
11 | 12502228778259 |
12 | 48a0869869a80 |
13 | 1a7452120c8c8 |
14 | a6001568a932 |
15 | 4d3801420da0 |
hex | 2668bf3318c0 |
42231326251200 has 168 divisors, whose sum is σ = 138659008350720. Its totient is φ = 11253147264000.
The previous prime is 42231326251117. The next prime is 42231326251253. The reversal of 42231326251200 is 215262313224.
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, 2996025 + ... + 9666375.
Almost surely, 242231326251200 is an apocalyptic number.
42231326251200 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 42231326251200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69329504175360).
42231326251200 is an abundant number, since it is smaller than the sum of its proper divisors (96427682099520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42231326251200 is a wasteful number, since it uses less digits than its factorization.
42231326251200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6671695 (or 6671680 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 42231326251200 its reverse (215262313224), we get a palindrome (42446588564424).
The spelling of 42231326251200 in words is "forty-two trillion, two hundred thirty-one billion, three hundred twenty-six million, two hundred fifty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •