Base | Representation |
---|---|
bin | 101000001011100011… |
… | …100000111111100001 |
3 | 11010100202011112102121 |
4 | 220023203200333201 |
5 | 1201324221020023 |
6 | 31453031344241 |
7 | 3055064655424 |
oct | 501343407741 |
9 | 133322145377 |
10 | 43143532513 |
11 | 1732a4435a4 |
12 | 8440822081 |
13 | 40b740cc83 |
14 | 2133c979bb |
15 | 11c797dd5d |
hex | a0b8e0fe1 |
43143532513 has 8 divisors (see below), whose sum is σ = 43517313000. Its totient is φ = 42771182208.
The previous prime is 43143532499. The next prime is 43143532571. The reversal of 43143532513 is 31523534134.
It can be written as a sum of positive squares in 4 ways, for example, as 25012371409 + 18131161104 = 158153^2 + 134652^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43143532513 is a prime.
It is a super-2 number, since 2×431435325132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (43143532573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 296908 + ... + 417661.
It is an arithmetic number, because the mean of its divisors is an integer number (5439664125).
Almost surely, 243143532513 is an apocalyptic number.
It is an amenable number.
43143532513 is a deficient number, since it is larger than the sum of its proper divisors (373780487).
43143532513 is a wasteful number, since it uses less digits than its factorization.
43143532513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715091.
The product of its digits is 64800, while the sum is 34.
The spelling of 43143532513 in words is "forty-three billion, one hundred forty-three million, five hundred thirty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •