Base | Representation |
---|---|
bin | 10011100110011011110000… |
… | …00111110011011111111111 |
3 | 12122121111211100000021200002 |
4 | 21303031320013303133333 |
5 | 21122140410101032411 |
6 | 231400442505424515 |
7 | 12036006020060351 |
oct | 1163157007633777 |
9 | 178544740007602 |
10 | 43102012127231 |
11 | 128085081a6912 |
12 | 4a0156079b13b |
13 | 1b0866b739315 |
14 | a902117670d1 |
15 | 4eb2b015633b |
hex | 2733781f37ff |
43102012127231 has 2 divisors, whose sum is σ = 43102012127232. Its totient is φ = 43102012127230.
The previous prime is 43102012127191. The next prime is 43102012127249. The reversal of 43102012127231 is 13272121020134.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43102012127231 - 214 = 43102012110847 is a prime.
It is a super-2 number, since 2×431020121272312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 43102012127194 and 43102012127203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43102012127281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21551006063615 + 21551006063616.
It is an arithmetic number, because the mean of its divisors is an integer number (21551006063616).
Almost surely, 243102012127231 is an apocalyptic number.
43102012127231 is a deficient number, since it is larger than the sum of its proper divisors (1).
43102012127231 is an equidigital number, since it uses as much as digits as its factorization.
43102012127231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4032, while the sum is 29.
Adding to 43102012127231 its reverse (13272121020134), we get a palindrome (56374133147365).
The spelling of 43102012127231 in words is "forty-three trillion, one hundred two billion, twelve million, one hundred twenty-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •