Base | Representation |
---|---|
bin | 10001100110110101010101… |
… | …10110010011011101001000 |
3 | 12002002101011012012101211010 |
4 | 20303122222312103131020 |
5 | 20033322323100141303 |
6 | 214202355550403520 |
7 | 11104155511156056 |
oct | 1063325266233510 |
9 | 162071135171733 |
10 | 38717701568328 |
11 | 113780a31921a2 |
12 | 44138bbb005a0 |
13 | 187b0a9931913 |
14 | 97bd37c751d6 |
15 | 472209da0c03 |
hex | 2336aad93748 |
38717701568328 has 64 divisors (see below), whose sum is σ = 97010176953600. Its totient is φ = 12877140907520.
The previous prime is 38717701568323. The next prime is 38717701568339. The reversal of 38717701568328 is 82386510771783.
38717701568328 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (38717701568323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19646038 + ... + 21526778.
It is an arithmetic number, because the mean of its divisors is an integer number (1515784014900).
Almost surely, 238717701568328 is an apocalyptic number.
It is an amenable number.
38717701568328 is an abundant number, since it is smaller than the sum of its proper divisors (58292475385272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38717701568328 is a wasteful number, since it uses less digits than its factorization.
38717701568328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1882662 (or 1882658 counting only the distinct ones).
The product of its (nonzero) digits is 94832640, while the sum is 66.
The spelling of 38717701568328 in words is "thirty-eight trillion, seven hundred seventeen billion, seven hundred one million, five hundred sixty-eight thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •