Base | Representation |
---|---|
bin | 100111100101100100… |
… | …010100110011000100 |
3 | 11001201022221012222121 |
4 | 213211210110303010 |
5 | 1144023042214000 |
6 | 31305503335324 |
7 | 3033225553645 |
oct | 474544246304 |
9 | 131638835877 |
10 | 42506210500 |
11 | 17032714096 |
12 | 82a32b1544 |
13 | 4015377760 |
14 | 20b33976cc |
15 | 118ba3cb1a |
hex | 9e5914cc4 |
42506210500 has 96 divisors (see below), whose sum is σ = 102677204448. Its totient is φ = 15270336000.
The previous prime is 42506210443. The next prime is 42506210501. The reversal of 42506210500 is 501260524.
It can be written as a sum of positive squares in 16 ways, for example, as 37542162564 + 4964047936 = 193758^2 + 70456^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (42506210501) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 152130 + ... + 328870.
It is an arithmetic number, because the mean of its divisors is an integer number (1069554213).
Almost surely, 242506210500 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 42506210500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51338602224).
42506210500 is an abundant number, since it is smaller than the sum of its proper divisors (60170993948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42506210500 is a wasteful number, since it uses less digits than its factorization.
42506210500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 176810 (or 176798 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The spelling of 42506210500 in words is "forty-two billion, five hundred six million, two hundred ten thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •