Base | Representation |
---|---|
bin | 10011001100111100010001… |
… | …00011110001010010110100 |
3 | 12112111202222112012220202012 |
4 | 21212132020203301102310 |
5 | 21013313040312042200 |
6 | 225450224221103352 |
7 | 11615510324455511 |
oct | 1146361043612264 |
9 | 175452875186665 |
10 | 42226114565300 |
11 | 124aaaa3926526 |
12 | 489b8543b7b58 |
13 | 1a73ba05649b3 |
14 | a5da7d444308 |
15 | 4d35e8b02a35 |
hex | 2667888f14b4 |
42226114565300 has 144 divisors (see below), whose sum is σ = 95349177387072. Its totient is φ = 16218456038400.
The previous prime is 42226114565291. The next prime is 42226114565329. The reversal of 42226114565300 is 356541162224.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 319410014 + ... + 319542186.
It is an arithmetic number, because the mean of its divisors is an integer number (662147065188).
Almost surely, 242226114565300 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 42226114565300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (47674588693536).
42226114565300 is an abundant number, since it is smaller than the sum of its proper divisors (53123062821772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42226114565300 is a wasteful number, since it uses less digits than its factorization.
42226114565300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133458 (or 133451 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 42226114565300 in words is "forty-two trillion, two hundred twenty-six billion, one hundred fourteen million, five hundred sixty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •