Base | Representation |
---|---|
bin | 10011100100101110000010… |
… | …11010000110111100100101 |
3 | 12122101212210111020220110112 |
4 | 21302113001122012330211 |
5 | 21120204243200320401 |
6 | 231313422134102405 |
7 | 12031522305216062 |
oct | 1162270132067445 |
9 | 178355714226415 |
10 | 43043112120101 |
11 | 12795532729775 |
12 | 49b20631aaa05 |
13 | 1b02c42b597b2 |
14 | a8b42500dc69 |
15 | 4e99b42873bb |
hex | 2725c1686f25 |
43043112120101 has 2 divisors, whose sum is σ = 43043112120102. Its totient is φ = 43043112120100.
The previous prime is 43043112120077. The next prime is 43043112120103. The reversal of 43043112120101 is 10102121134034.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24380150515876 + 18662961604225 = 4937626^2 + 4320065^2 .
It is a cyclic number.
It is not a de Polignac number, because 43043112120101 - 230 = 43042038378277 is a prime.
Together with 43043112120103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43043112120103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21521556060050 + 21521556060051.
It is an arithmetic number, because the mean of its divisors is an integer number (21521556060051).
Almost surely, 243043112120101 is an apocalyptic number.
It is an amenable number.
43043112120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
43043112120101 is an equidigital number, since it uses as much as digits as its factorization.
43043112120101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 43043112120101 its reverse (10102121134034), we get a palindrome (53145233254135).
The spelling of 43043112120101 in words is "forty-three trillion, forty-three billion, one hundred twelve million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •