Base | Representation |
---|---|
bin | 1010010111100… |
… | …0011011000101 |
3 | 10000211021000201 |
4 | 2211320123011 |
5 | 42113003434 |
6 | 4152010501 |
7 | 1035421021 |
oct | 245703305 |
9 | 100737021 |
10 | 43484869 |
11 | 2260090a |
12 | 12690a31 |
13 | 9016abc |
14 | 5abd381 |
15 | 3c3e614 |
hex | 29786c5 |
43484869 has 2 divisors, whose sum is σ = 43484870. Its totient is φ = 43484868.
The previous prime is 43484821. The next prime is 43484897. The reversal of 43484869 is 96848434.
It is a happy number.
43484869 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35247969 + 8236900 = 5937^2 + 2870^2 .
It is a cyclic number.
It is not a de Polignac number, because 43484869 - 27 = 43484741 is a prime.
It is a super-2 number, since 2×434848692 = 3781867663894322, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43484269) 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 as a sum of consecutive naturals, namely, 21742434 + 21742435.
It is an arithmetic number, because the mean of its divisors is an integer number (21742435).
Almost surely, 243484869 is an apocalyptic number.
It is an amenable number.
43484869 is a deficient number, since it is larger than the sum of its proper divisors (1).
43484869 is an equidigital number, since it uses as much as digits as its factorization.
43484869 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 663552, while the sum is 46.
The square root of 43484869 is about 6594.3058012197. The cubic root of 43484869 is about 351.6517006077.
The spelling of 43484869 in words is "forty-three million, four hundred eighty-four thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •