Base | Representation |
---|---|
bin | 10001101100010101110010… |
… | …10100000000101000000000 |
3 | 12002202110120100022210112200 |
4 | 20312022321110000220000 |
5 | 20044422334214010233 |
6 | 214425332114153200 |
7 | 11123634550113330 |
oct | 1066127124005000 |
9 | 162673510283480 |
10 | 38906922797568 |
11 | 11440373688391 |
12 | 4444509882800 |
13 | 1892ba3b04517 |
14 | 9871685d30c0 |
15 | 4770d1dd5313 |
hex | 2362b9500a00 |
38906922797568 has 960 divisors, whose sum is σ = 141211633305600. Its totient is φ = 10056263270400.
The previous prime is 38906922797539. The next prime is 38906922797623. The reversal of 38906922797568 is 86579722960983.
38906922797568 is a `hidden beast` number, since 389 + 0 + 6 + 9 + 227 + 9 + 7 + 5 + 6 + 8 = 666.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2532830208 + ... + 2532845568.
It is an arithmetic number, because the mean of its divisors is an integer number (147095451360).
Almost surely, 238906922797568 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 38906922797568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70605816652800).
38906922797568 is an abundant number, since it is smaller than the sum of its proper divisors (102304710508032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38906922797568 is a wasteful number, since it uses less digits than its factorization.
38906922797568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15589 (or 15570 counting only the distinct ones).
The product of its (nonzero) digits is 4938071040, while the sum is 81.
The spelling of 38906922797568 in words is "thirty-eight trillion, nine hundred six billion, nine hundred twenty-two million, seven hundred ninety-seven thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •