Base | Representation |
---|---|
bin | 1010010001110… |
… | …0000001101101 |
3 | 10000010000212211 |
4 | 2210130001231 |
5 | 42013401123 |
6 | 4135530421 |
7 | 1032253450 |
oct | 244340155 |
9 | 100100784 |
10 | 43106413 |
11 | 22372539 |
12 | 12529a11 |
13 | 8c1376c |
14 | 5a21497 |
15 | 3bb740d |
hex | 291c06d |
43106413 has 4 divisors (see below), whose sum is σ = 49264480. Its totient is φ = 36948348.
The previous prime is 43106411. The next prime is 43106419. The reversal of 43106413 is 31460134.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31460134 = 2 ⋅15730067.
It is a cyclic number.
It is not a de Polignac number, because 43106413 - 21 = 43106411 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43106411) 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 3 ways as a sum of consecutive naturals, for example, 3079023 + ... + 3079036.
It is an arithmetic number, because the mean of its divisors is an integer number (12316120).
Almost surely, 243106413 is an apocalyptic number.
It is an amenable number.
43106413 is a deficient number, since it is larger than the sum of its proper divisors (6158067).
43106413 is an equidigital number, since it uses as much as digits as its factorization.
43106413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6158066.
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 43106413 is about 6565.5474257673. The cubic root of 43106413 is about 350.6285657199.
Adding to 43106413 its reverse (31460134), we get a palindrome (74566547).
The spelling of 43106413 in words is "forty-three million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •