Base | Representation |
---|---|
bin | 111111111011111… |
… | …000110111100000 |
3 | 2202202101222102111 |
4 | 333323320313200 |
5 | 4144100222112 |
6 | 254234525104 |
7 | 35403331246 |
oct | 7773706740 |
9 | 2682358374 |
10 | 1072664032 |
11 | 500544400 |
12 | 25b296794 |
13 | 1412cc45b |
14 | a2664796 |
15 | 642865a7 |
hex | 3fef8de0 |
1072664032 has 72 divisors (see below), whose sum is σ = 2365492248. Its totient is φ = 478283520.
The previous prime is 1072664023. The next prime is 1072664039. The reversal of 1072664032 is 2304662701.
It is a junction number, because it is equal to n+sod(n) for n = 1072663985 and 1072664003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1072664039) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 202603 + ... + 207829.
It is an arithmetic number, because the mean of its divisors is an integer number (32854059).
Almost surely, 21072664032 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 1072664032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1182746124).
1072664032 is an abundant number, since it is smaller than the sum of its proper divisors (1292828216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1072664032 is a wasteful number, since it uses less digits than its factorization.
1072664032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5312 (or 5293 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 31.
The square root of 1072664032 is about 32751.5500701875. The cubic root of 1072664032 is about 1023.6572644487.
The spelling of 1072664032 in words is "one billion, seventy-two million, six hundred sixty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •