Base | Representation |
---|---|
bin | 1010010000110… |
… | …0000000101000 |
3 | 2222222200220000 |
4 | 2210030000220 |
5 | 42004301213 |
6 | 4134303000 |
7 | 1031561256 |
oct | 244140050 |
9 | 88880800 |
10 | 43040808 |
11 | 22328218 |
12 | 124b7a60 |
13 | 8bbc945 |
14 | 5a055d6 |
15 | 3ba2c73 |
hex | 290c028 |
43040808 has 80 divisors (see below), whose sum is σ = 121735680. Its totient is φ = 14206752.
The previous prime is 43040791. The next prime is 43040813. The reversal of 43040808 is 80804034.
It is a super-2 number, since 2×430408082 = 3705022306585728, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 3.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 82035 + ... + 82557.
It is an arithmetic number, because the mean of its divisors is an integer number (1521696).
Almost surely, 243040808 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 43040808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60867840).
43040808 is an abundant number, since it is smaller than the sum of its proper divisors (78694872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43040808 is a wasteful number, since it uses less digits than its factorization.
43040808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668 (or 655 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
The square root of 43040808 is about 6560.5493672405. The cubic root of 43040808 is about 350.4505978725.
The spelling of 43040808 in words is "forty-three million, forty thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •