Base | Representation |
---|---|
bin | 111100100110111… |
… | …000101001000000 |
3 | 2121212100010122020 |
4 | 330212320221000 |
5 | 4040301421212 |
6 | 244522041440 |
7 | 34124611356 |
oct | 7446705100 |
9 | 2555303566 |
10 | 1016826432 |
11 | 481a76826 |
12 | 244649280 |
13 | 13287bc5b |
14 | 9908b7d6 |
15 | 5e406d8c |
hex | 3c9b8a40 |
1016826432 has 56 divisors (see below), whose sum is σ = 2714219616. Its totient is φ = 335935488.
The previous prime is 1016826409. The next prime is 1016826463. The reversal of 1016826432 is 2346286101.
It is a junction number, because it is equal to n+sod(n) for n = 1016826393 and 1016826402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1738 + ... + 45129.
Almost surely, 21016826432 is an apocalyptic number.
1016826432 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 1016826432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1357109808).
1016826432 is an abundant number, since it is smaller than the sum of its proper divisors (1697393184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1016826432 is a wasteful number, since it uses less digits than its factorization.
1016826432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46995 (or 46985 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 1016826432 is about 31887.7160047564. The cubic root of 1016826432 is about 1005.5776427279.
The spelling of 1016826432 in words is "one billion, sixteen million, eight hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •