Base | Representation |
---|---|
bin | 111101111001001… |
… | …101101111100000 |
3 | 2200100221121220110 |
4 | 331321031233200 |
5 | 4111313034142 |
6 | 251012411320 |
7 | 34506220350 |
oct | 7571155740 |
9 | 2610847813 |
10 | 1038408672 |
11 | 493177894 |
12 | 24b916b40 |
13 | 137197602 |
14 | 9bca8b60 |
15 | 6126b99c |
hex | 3de4dbe0 |
1038408672 has 192 divisors, whose sum is σ = 3305594880. Its totient is φ = 278816256.
The previous prime is 1038408661. The next prime is 1038408697. The reversal of 1038408672 is 2768048301.
It is a self number, because there is not a number n which added to its sum of digits gives 1038408672.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2132013 + ... + 2132499.
It is an arithmetic number, because the mean of its divisors is an integer number (17216640).
Almost surely, 21038408672 is an apocalyptic number.
1038408672 is a gapful number since it is divisible by the number (12) 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 1038408672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1652797440).
1038408672 is an abundant number, since it is smaller than the sum of its proper divisors (2267186208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1038408672 is a wasteful number, since it uses less digits than its factorization.
1038408672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693 (or 685 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 39.
The square root of 1038408672 is about 32224.3490547133. The cubic root of 1038408672 is about 1012.6423871693.
The spelling of 1038408672 in words is "one billion, thirty-eight million, four hundred eight thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •