Base | Representation |
---|---|
bin | 111101011011111… |
… | …100001101010000 |
3 | 2122211111202011020 |
4 | 331123330031100 |
5 | 4102332002142 |
6 | 250140115440 |
7 | 34354046232 |
oct | 7533741520 |
9 | 2584452136 |
10 | 1030734672 |
11 | 489906240 |
12 | 249235b80 |
13 | 13570b696 |
14 | 9ac6c252 |
15 | 60752cec |
hex | 3d6fc350 |
1030734672 has 80 divisors (see below), whose sum is σ = 2959685568. Its totient is φ = 306442240.
The previous prime is 1030734643. The next prime is 1030734703. The reversal of 1030734672 is 2764370301.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9568 + ... + 46400.
Almost surely, 21030734672 is an apocalyptic number.
1030734672 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 1030734672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1479842784).
1030734672 is an abundant number, since it is smaller than the sum of its proper divisors (1928950896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030734672 is a wasteful number, since it uses less digits than its factorization.
1030734672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36908 (or 36902 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 33.
The square root of 1030734672 is about 32105.0567979563. The cubic root of 1030734672 is about 1010.1416891048.
The spelling of 1030734672 in words is "one billion, thirty million, seven hundred thirty-four thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •