Base | Representation |
---|---|
bin | 100111111010001011… |
… | …110010100100000100 |
3 | 11002121102210020200000 |
4 | 213322023302210010 |
5 | 1200230114202411 |
6 | 31404101121300 |
7 | 3044625562122 |
oct | 477213624404 |
9 | 132542706600 |
10 | 42852100356 |
11 | 1719a99127a |
12 | 837b0b9230 |
13 | 406bc21c00 |
14 | 21072b4912 |
15 | 11ac0b3956 |
hex | 9fa2f2904 |
42852100356 has 216 divisors, whose sum is σ = 122147756640. Its totient is φ = 13130118144.
The previous prime is 42852100303. The next prime is 42852100363. The reversal of 42852100356 is 65300125824.
42852100356 is a `hidden beast` number, since 4 + 285 + 21 + 0 + 0 + 356 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 42852100356.
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, 57986235 + ... + 57986973.
Almost surely, 242852100356 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 42852100356, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61073878320).
42852100356 is an abundant number, since it is smaller than the sum of its proper divisors (79295656284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42852100356 is a wasteful number, since it uses less digits than its factorization.
42852100356 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137 (or 1110 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 42852100356 in words is "forty-two billion, eight hundred fifty-two million, one hundred thousand, three hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •