Base | Representation |
---|---|
bin | 100100001111100011… |
… | …110101110011111000 |
3 | 10201110002212101221110 |
4 | 210033203311303320 |
5 | 1114144413244402 |
6 | 25513323440320 |
7 | 2545240332231 |
oct | 441743656370 |
9 | 121402771843 |
10 | 38915759352 |
11 | 1555aa27a98 |
12 | 76609860a0 |
13 | 389255ba52 |
14 | 1c525b2088 |
15 | 102b71556c |
hex | 90f8f5cf8 |
38915759352 has 32 divisors (see below), whose sum is σ = 97295202000. Its totient is φ = 12971145984.
The previous prime is 38915759341. The next prime is 38915759401. The reversal of 38915759352 is 25395751983.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 38915759292 and 38915759301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 480274 + ... + 555422.
Almost surely, 238915759352 is an apocalyptic number.
It is an amenable number.
38915759352 is an abundant number, since it is smaller than the sum of its proper divisors (58379442648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38915759352 is a wasteful number, since it uses less digits than its factorization.
38915759352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96735 (or 96731 counting only the distinct ones).
The product of its digits is 10206000, while the sum is 57.
The spelling of 38915759352 in words is "thirty-eight billion, nine hundred fifteen million, seven hundred fifty-nine thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •