Base | Representation |
---|---|
bin | 1001010100001111010100… |
… | …1000000000010100011011 |
3 | 1100021020210012111001200222 |
4 | 2111003311020000110123 |
5 | 2320311302011100133 |
6 | 33441414100150255 |
7 | 2105024612034311 |
oct | 225036510002433 |
9 | 40236705431628 |
10 | 10243314550043 |
11 | 329a190025813 |
12 | 119528139838b |
13 | 593c2c134b63 |
14 | 275ac9aa40b1 |
15 | 12b6bad77e98 |
hex | 950f520051b |
10243314550043 has 2 divisors, whose sum is σ = 10243314550044. Its totient is φ = 10243314550042.
The previous prime is 10243314550039. The next prime is 10243314550061. The reversal of 10243314550043 is 34005541334201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10243314550043 - 22 = 10243314550039 is a prime.
It is a super-2 number, since 2×102433145500432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10243314549985 and 10243314550012.
It is not a weakly prime, because it can be changed into another prime (10243314550543) 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, 5121657275021 + 5121657275022.
It is an arithmetic number, because the mean of its divisors is an integer number (5121657275022).
Almost surely, 210243314550043 is an apocalyptic number.
10243314550043 is a deficient number, since it is larger than the sum of its proper divisors (1).
10243314550043 is an equidigital number, since it uses as much as digits as its factorization.
10243314550043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 10243314550043 its reverse (34005541334201), we get a palindrome (44248855884244).
The spelling of 10243314550043 in words is "ten trillion, two hundred forty-three billion, three hundred fourteen million, five hundred fifty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •