Base | Representation |
---|---|
bin | 100100010100011000… |
… | …110001011000000000 |
3 | 10201122202020211120000 |
4 | 210110120301120000 |
5 | 1114331131244210 |
6 | 25525335320000 |
7 | 2550242565156 |
oct | 442430613000 |
9 | 121582224500 |
10 | 38996743680 |
11 | 155a1710794 |
12 | 7683b20000 |
13 | 38a627517b |
14 | 1c5d2533d6 |
15 | 10338b0ac0 |
hex | 914631600 |
38996743680 has 400 divisors, whose sum is σ = 142009799184. Its totient is φ = 10225336320.
The previous prime is 38996743631. The next prime is 38996743727. The reversal of 38996743680 is 8634769983.
38996743680 is a `hidden beast` number, since 38 + 9 + 96 + 7 + 436 + 80 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 12647419 + ... + 12650501.
Almost surely, 238996743680 is an apocalyptic number.
38996743680 is a gapful number since it is divisible by the number (30) 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 38996743680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71004899592).
38996743680 is an abundant number, since it is smaller than the sum of its proper divisors (103013055504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38996743680 is an equidigital number, since it uses as much as digits as its factorization.
38996743680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3179 (or 3154 counting only the distinct ones).
The product of its (nonzero) digits is 47029248, while the sum is 63.
The spelling of 38996743680 in words is "thirty-eight billion, nine hundred ninety-six million, seven hundred forty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •