Base | Representation |
---|---|
bin | 10000000011100011100… |
… | …110110100000010011011 |
3 | 10220110212222111000001102 |
4 | 100003203212310002123 |
5 | 121034110014333202 |
6 | 2202510215542015 |
7 | 142466360135105 |
oct | 20034346640233 |
9 | 3813788430042 |
10 | 1103330230427 |
11 | 395a13173447 |
12 | 1599bb08a90b |
13 | 80074a13419 |
14 | 3b5898b2575 |
15 | 1da78025d02 |
hex | 100e39b409b |
1103330230427 has 2 divisors, whose sum is σ = 1103330230428. Its totient is φ = 1103330230426.
The previous prime is 1103330230367. The next prime is 1103330230487. The reversal of 1103330230427 is 7240320333011.
It is a balanced prime because it is at equal distance from previous prime (1103330230367) and next prime (1103330230487).
It is a cyclic number.
It is not a de Polignac number, because 1103330230427 - 214 = 1103330214043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1103330230427.
It is not a weakly prime, because it can be changed into another prime (1103330230487) 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, 551665115213 + 551665115214.
It is an arithmetic number, because the mean of its divisors is an integer number (551665115214).
Almost surely, 21103330230427 is an apocalyptic number.
1103330230427 is a deficient number, since it is larger than the sum of its proper divisors (1).
1103330230427 is an equidigital number, since it uses as much as digits as its factorization.
1103330230427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 29.
Adding to 1103330230427 its reverse (7240320333011), we get a palindrome (8343650563438).
The spelling of 1103330230427 in words is "one trillion, one hundred three billion, three hundred thirty million, two hundred thirty thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •