Base | Representation |
---|---|
bin | 1010010101110… |
… | …0100011110100 |
3 | 10000121110110201 |
4 | 2211130203310 |
5 | 42100330430 |
6 | 4145330244 |
7 | 1034434210 |
oct | 245344364 |
9 | 100543421 |
10 | 43370740 |
11 | 22533096 |
12 | 12636984 |
13 | 8ca6b7a |
14 | 5a8d940 |
15 | 3c1a8ca |
hex | 295c8f4 |
43370740 has 48 divisors (see below), whose sum is σ = 110218752. Its totient is φ = 13994496.
The previous prime is 43370731. The next prime is 43370741. The reversal of 43370740 is 4707334.
43370740 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 43370699 and 43370708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43370741) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 6732 + ... + 11491.
It is an arithmetic number, because the mean of its divisors is an integer number (2296224).
Almost surely, 243370740 is an apocalyptic number.
It is an amenable number.
43370740 is an abundant number, since it is smaller than the sum of its proper divisors (66848012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
43370740 is a wasteful number, since it uses less digits than its factorization.
43370740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18256 (or 18254 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 28.
The square root of 43370740 is about 6585.6465134412. The cubic root of 43370740 is about 351.3437864579.
The spelling of 43370740 in words is "forty-three million, three hundred seventy thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •