Base | Representation |
---|---|
bin | 101000001111001011… |
… | …010101000100111001 |
3 | 11010111222111220021111 |
4 | 220033023111010321 |
5 | 1201440300113423 |
6 | 31503042040321 |
7 | 3056433333361 |
oct | 501713250471 |
9 | 133458456244 |
10 | 43204301113 |
11 | 17360779986 |
12 | 84590490a1 |
13 | 40c6b98a1c |
14 | 213bd959a1 |
15 | 11cce8460d |
hex | a0f2d5139 |
43204301113 has 2 divisors, whose sum is σ = 43204301114. Its totient is φ = 43204301112.
The previous prime is 43204301111. The next prime is 43204301183. The reversal of 43204301113 is 31110340234.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39295925824 + 3908375289 = 198232^2 + 62517^2 .
It is a cyclic number.
It is not a de Polignac number, because 43204301113 - 21 = 43204301111 is a prime.
It is a super-2 number, since 2×432043011132 (a number of 22 digits) contains 22 as substring.
Together with 43204301111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (43204301111) 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 as a sum of consecutive naturals, namely, 21602150556 + 21602150557.
It is an arithmetic number, because the mean of its divisors is an integer number (21602150557).
Almost surely, 243204301113 is an apocalyptic number.
It is an amenable number.
43204301113 is a deficient number, since it is larger than the sum of its proper divisors (1).
43204301113 is an equidigital number, since it uses as much as digits as its factorization.
43204301113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 43204301113 its reverse (31110340234), we get a palindrome (74314641347).
The spelling of 43204301113 in words is "forty-three billion, two hundred four million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •