Base | Representation |
---|---|
bin | 101000010001011000… |
… | …100001000010011101 |
3 | 11010121120011021020101 |
4 | 220101120201002131 |
5 | 1202024233444123 |
6 | 31510443221101 |
7 | 3060363043135 |
oct | 502130410235 |
9 | 133546137211 |
10 | 43241312413 |
11 | 1737a659032 |
12 | 8469517791 |
13 | 41017570c0 |
14 | 2142c6bac5 |
15 | 11d1345aad |
hex | a1162109d |
43241312413 has 8 divisors (see below), whose sum is σ = 46573833600. Its totient is φ = 39909686448.
The previous prime is 43241312377. The next prime is 43241312447. The reversal of 43241312413 is 31421314234.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 43241312413 - 217 = 43241181341 is a prime.
It is a super-2 number, since 2×432413124132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (43241312473) 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 7 ways as a sum of consecutive naturals, for example, 121753 + ... + 318286.
It is an arithmetic number, because the mean of its divisors is an integer number (5821729200).
Almost surely, 243241312413 is an apocalyptic number.
It is an amenable number.
43241312413 is a deficient number, since it is larger than the sum of its proper divisors (3332521187).
43241312413 is a wasteful number, since it uses less digits than its factorization.
43241312413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 447611.
The product of its digits is 6912, while the sum is 28.
Adding to 43241312413 its reverse (31421314234), we get a palindrome (74662626647).
The spelling of 43241312413 in words is "forty-three billion, two hundred forty-one million, three hundred twelve thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •