Base | Representation |
---|---|
bin | 10000010100001000001… |
… | …010000011001000000011 |
3 | 10222011211000022102011012 |
4 | 100110020022003020003 |
5 | 121332030032104402 |
6 | 2215011551311135 |
7 | 143666323644605 |
oct | 20241012031003 |
9 | 3864730272135 |
10 | 1121123316227 |
11 | 3a2513980132 |
12 | 161345b1b4ab |
13 | 8194c108565 |
14 | 3c396a3b175 |
15 | 1e26a15b452 |
hex | 10508283203 |
1121123316227 has 2 divisors, whose sum is σ = 1121123316228. Its totient is φ = 1121123316226.
The previous prime is 1121123316221. The next prime is 1121123316233. The reversal of 1121123316227 is 7226133211211.
It is a balanced prime because it is at equal distance from previous prime (1121123316221) and next prime (1121123316233).
It is a cyclic number.
It is not a de Polignac number, because 1121123316227 - 24 = 1121123316211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121123316193 and 1121123316202.
It is not a weakly prime, because it can be changed into another prime (1121123316221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560561658113 + 560561658114.
It is an arithmetic number, because the mean of its divisors is an integer number (560561658114).
Almost surely, 21121123316227 is an apocalyptic number.
1121123316227 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121123316227 is an equidigital number, since it uses as much as digits as its factorization.
1121123316227 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6048, while the sum is 32.
Adding to 1121123316227 its reverse (7226133211211), we get a palindrome (8347256527438).
The spelling of 1121123316227 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-three million, three hundred sixteen thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •