Base | Representation |
---|---|
bin | 10000010110010001010… |
… | …010111000011101011011 |
3 | 10222101202100122212110012 |
4 | 100112101102320131123 |
5 | 121401233033013202 |
6 | 2220032141312135 |
7 | 144110332244453 |
oct | 20262122703533 |
9 | 3871670585405 |
10 | 1123424110427 |
11 | 3a3494693943 |
12 | 16188856564b |
13 | 81c2799b048 |
14 | 3c534434d63 |
15 | 1e352138152 |
hex | 105914b875b |
1123424110427 has 2 divisors, whose sum is σ = 1123424110428. Its totient is φ = 1123424110426.
The previous prime is 1123424110387. The next prime is 1123424110507. The reversal of 1123424110427 is 7240114243211.
It is a weak prime.
It is an emirp because it is prime and its reverse (7240114243211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1123424110427 - 26 = 1123424110363 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1123424110393 and 1123424110402.
It is not a weakly prime, because it can be changed into another prime (1123424116427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561712055213 + 561712055214.
It is an arithmetic number, because the mean of its divisors is an integer number (561712055214).
Almost surely, 21123424110427 is an apocalyptic number.
1123424110427 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123424110427 is an equidigital number, since it uses as much as digits as its factorization.
1123424110427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10752, while the sum is 32.
Adding to 1123424110427 its reverse (7240114243211), we get a palindrome (8363538353638).
The spelling of 1123424110427 in words is "one trillion, one hundred twenty-three billion, four hundred twenty-four million, one hundred ten thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •