Base | Representation |
---|---|
bin | 100100000101011101… |
… | …110011011010010100 |
3 | 10201000022012021202112 |
4 | 210011131303122110 |
5 | 1113323034421000 |
6 | 25444433530152 |
7 | 2541113001266 |
oct | 440535633224 |
9 | 121008167675 |
10 | 38746404500 |
11 | 15483376201 |
12 | 7614113958 |
13 | 386644428b |
14 | 1c37cc9b36 |
15 | 101b911235 |
hex | 905773694 |
38746404500 has 36 divisors (see below), whose sum is σ = 84631761396. Its totient is φ = 15496801200.
The previous prime is 38746404479. The next prime is 38746404503. The reversal of 38746404500 is 540464783.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 2 ways, for example, as 1239884944 + 37506519556 = 35212^2 + 193666^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (38746404503) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 4397099 + ... + 4405901.
It is an arithmetic number, because the mean of its divisors is an integer number (2350882261).
Almost surely, 238746404500 is an apocalyptic number.
It is an amenable number.
38746404500 is an abundant number, since it is smaller than the sum of its proper divisors (45885356896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38746404500 is an frugal number, since it uses more digits than its factorization.
38746404500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17625 (or 8810 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 41.
The spelling of 38746404500 in words is "thirty-eight billion, seven hundred forty-six million, four hundred four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •