Base | Representation |
---|---|
bin | 100011011100000000… |
… | …111011111010000000 |
3 | 10122012211121121201000 |
4 | 203130000323322000 |
5 | 1110412022040024 |
6 | 25251432212000 |
7 | 2514636630165 |
oct | 433400737200 |
9 | 118184547630 |
10 | 38050971264 |
11 | 15156865999 |
12 | 745b23a000 |
13 | 3785343717 |
14 | 1bad7c006c |
15 | eca841cc9 |
hex | 8dc03be80 |
38050971264 has 128 divisors (see below), whose sum is σ = 112401388800. Its totient is φ = 12672571392.
The previous prime is 38050971247. The next prime is 38050971317. The reversal of 38050971264 is 46217905083.
38050971264 is a `hidden beast` number, since 3 + 80 + 509 + 7 + 1 + 2 + 64 = 666.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4581964 + ... + 4590260.
It is an arithmetic number, because the mean of its divisors is an integer number (878135850).
It is a 1-persistent number, because it is pandigital, but 2⋅38050971264 = 76101942528 is not.
Almost surely, 238050971264 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 38050971264, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56200694400).
38050971264 is an abundant number, since it is smaller than the sum of its proper divisors (74350417536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
38050971264 is a wasteful number, since it uses less digits than its factorization.
38050971264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9647 (or 9629 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 45.
The spelling of 38050971264 in words is "thirty-eight billion, fifty million, nine hundred seventy-one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •