Base | Representation |
---|---|
bin | 111110101010110… |
… | …101100100000000 |
3 | 2201021102111202011 |
4 | 332222311210000 |
5 | 4123130314312 |
6 | 252155302304 |
7 | 35024616124 |
oct | 7652654400 |
9 | 2637374664 |
10 | 1051416832 |
11 | 49a552034 |
12 | 25414a994 |
13 | 139aa044b |
14 | 9d8d3584 |
15 | 6248ada7 |
hex | 3eab5900 |
1051416832 has 108 divisors (see below), whose sum is σ = 2292681216. Its totient is φ = 480660480.
The previous prime is 1051416811. The next prime is 1051416841. The reversal of 1051416832 is 2386141501.
It is a super-2 number, since 2×10514168322 = 2210954709225832448, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 1051416794 and 1051416803.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2864713 + ... + 2865079.
Almost surely, 21051416832 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 1051416832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1146340608).
1051416832 is an abundant number, since it is smaller than the sum of its proper divisors (1241264384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1051416832 is an equidigital number, since it uses as much as digits as its factorization.
1051416832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 31.
The square root of 1051416832 is about 32425.5583143914. The cubic root of 1051416832 is about 1016.8533141625.
The spelling of 1051416832 in words is "one billion, fifty-one million, four hundred sixteen thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •