Base | Representation |
---|---|
bin | 101000000001100001… |
… | …000010001000000000 |
3 | 11002221000020202200010 |
4 | 220001201002020000 |
5 | 1201003112002012 |
6 | 31424213424520 |
7 | 3050651255550 |
oct | 500141021000 |
9 | 132830222603 |
10 | 42975109632 |
11 | 17253368a34 |
12 | 83b433b140 |
13 | 408b560770 |
14 | 2119775160 |
15 | 11b7cb0c3c |
hex | a01842200 |
42975109632 has 320 divisors, whose sum is σ = 142044908544. Its totient is φ = 11242782720.
The previous prime is 42975109627. The next prime is 42975109633. The reversal of 42975109632 is 23690157924.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (42975109633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18309483 + ... + 18311829.
Almost surely, 242975109632 is an apocalyptic number.
42975109632 is a gapful number since it is divisible by the number (42) 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 42975109632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71022454272).
42975109632 is an abundant number, since it is smaller than the sum of its proper divisors (99069798912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42975109632 is a wasteful number, since it uses less digits than its factorization.
42975109632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2519 (or 2503 counting only the distinct ones).
The product of its (nonzero) digits is 816480, while the sum is 48.
The spelling of 42975109632 in words is "forty-two billion, nine hundred seventy-five million, one hundred nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •