Base | Representation |
---|---|
bin | 10011100110011110011001… |
… | …10100000011001110000111 |
3 | 12122121122111100122201021201 |
4 | 21303033030310003032013 |
5 | 21122201312322341403 |
6 | 231401235504123331 |
7 | 12036056152306012 |
oct | 1163171464031607 |
9 | 178548440581251 |
10 | 43103433012103 |
11 | 1280907725a732 |
12 | 4a01898606547 |
13 | 1b08836c1abb9 |
14 | a90308354379 |
15 | 4eb344c7421d |
hex | 2733ccd03387 |
43103433012103 has 2 divisors, whose sum is σ = 43103433012104. Its totient is φ = 43103433012102.
The previous prime is 43103433012047. The next prime is 43103433012109. The reversal of 43103433012103 is 30121033430134.
43103433012103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 43103433012103 - 229 = 43102896141191 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43103433012109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21551716506051 + 21551716506052.
It is an arithmetic number, because the mean of its divisors is an integer number (21551716506052).
Almost surely, 243103433012103 is an apocalyptic number.
43103433012103 is a deficient number, since it is larger than the sum of its proper divisors (1).
43103433012103 is an equidigital number, since it uses as much as digits as its factorization.
43103433012103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 43103433012103 its reverse (30121033430134), we get a palindrome (73224466442237).
The spelling of 43103433012103 in words is "forty-three trillion, one hundred three billion, four hundred thirty-three million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •