Base | Representation |
---|---|
bin | 111110001110010… |
… | …110001010110000 |
3 | 2200202101001201110 |
4 | 332032112022300 |
5 | 4114222320313 |
6 | 251331233320 |
7 | 34604261532 |
oct | 7616261260 |
9 | 2622331643 |
10 | 1043948208 |
11 | 496310816 |
12 | 251748840 |
13 | 138386b44 |
14 | 9c90b852 |
15 | 619b2ec3 |
hex | 3e3962b0 |
1043948208 has 80 divisors (see below), whose sum is σ = 2806534656. Its totient is φ = 334114560.
The previous prime is 1043948207. The next prime is 1043948231. The reversal of 1043948208 is 8028493401.
1043948208 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10439482082 = 2179655721972822528, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1043948201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 115203 + ... + 123933.
Almost surely, 21043948208 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 1043948208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1403267328).
1043948208 is an abundant number, since it is smaller than the sum of its proper divisors (1762586448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043948208 is a wasteful number, since it uses less digits than its factorization.
1043948208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8842 (or 8836 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 39.
The square root of 1043948208 is about 32310.1873717872. The cubic root of 1043948208 is about 1014.4398886599.
The spelling of 1043948208 in words is "one billion, forty-three million, nine hundred forty-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •