Base | Representation |
---|---|
bin | 111110001101100… |
… | …001000001000000 |
3 | 2200201222000002001 |
4 | 332031201001000 |
5 | 4114143333441 |
6 | 251322433344 |
7 | 34602364024 |
oct | 7615410100 |
9 | 2621860061 |
10 | 1043730496 |
11 | 496182196 |
12 | 251662854 |
13 | 13830ba13 |
14 | 9c892384 |
15 | 6196d731 |
hex | 3e361040 |
1043730496 has 56 divisors (see below), whose sum is σ = 2216058560. Its totient is φ = 486259200.
The previous prime is 1043730463. The next prime is 1043730497. The reversal of 1043730496 is 6940373401.
It is not an unprimeable number, because it can be changed into a prime (1043730497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67141 + ... + 81211.
Almost surely, 21043730496 is an apocalyptic number.
1043730496 is a gapful number since it is divisible by the number (16) 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 1043730496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1108029280).
1043730496 is an abundant number, since it is smaller than the sum of its proper divisors (1172328064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043730496 is a wasteful number, since it uses less digits than its factorization.
1043730496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14163 (or 14153 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 37.
The square root of 1043730496 is about 32306.8181039235. The cubic root of 1043730496 is about 1014.3693643785.
The spelling of 1043730496 in words is "one billion, forty-three million, seven hundred thirty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •