Base | Representation |
---|---|
bin | 100111010000000010… |
… | …011010111000010000 |
3 | 11000210011020212200002 |
4 | 213100002122320100 |
5 | 1142303110012401 |
6 | 31210001345132 |
7 | 3021251411651 |
oct | 472002327020 |
9 | 130704225602 |
10 | 42145000976 |
11 | 16967833021 |
12 | 82023381a8 |
13 | 3c88598300 |
14 | 207b40d528 |
15 | 1169e8ca6b |
hex | 9d009ae10 |
42145000976 has 60 divisors (see below), whose sum is σ = 88758033408. Its totient is φ = 19377251712.
The previous prime is 42145000949. The next prime is 42145000979. The reversal of 42145000976 is 67900054124.
It is a super-2 number, since 2×421450009762 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (42145000979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 681521 + ... + 740783.
Almost surely, 242145000976 is an apocalyptic number.
42145000976 is the 118526-th octagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42145000976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44379016704).
42145000976 is an abundant number, since it is smaller than the sum of its proper divisors (46613032432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42145000976 is a wasteful number, since it uses less digits than its factorization.
42145000976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59560 (or 59541 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 38.
The spelling of 42145000976 in words is "forty-two billion, one hundred forty-five million, nine hundred seventy-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •