Base | Representation |
---|---|
bin | 10000010011010001110… |
… | …011000111000011111001 |
3 | 10222002110110020212212022 |
4 | 100103101303013003321 |
5 | 121323143100131434 |
6 | 2214341252324225 |
7 | 143634611140502 |
oct | 20232163070371 |
9 | 3862413225768 |
10 | 1120211333369 |
11 | 3a2096103997 |
12 | 161130613675 |
13 | 818351a792b |
14 | 3c30b881ba9 |
15 | 1e21506422e |
hex | 104d1cc70f9 |
1120211333369 has 2 divisors, whose sum is σ = 1120211333370. Its totient is φ = 1120211333368.
The previous prime is 1120211333249. The next prime is 1120211333393. The reversal of 1120211333369 is 9633331120211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1109641026025 + 10570307344 = 1053395^2 + 102812^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120211333369 - 28 = 1120211333113 is a prime.
It is a super-3 number, since 3×11202113333693 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1120211333569) 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, 560105666684 + 560105666685.
It is an arithmetic number, because the mean of its divisors is an integer number (560105666685).
Almost surely, 21120211333369 is an apocalyptic number.
It is an amenable number.
1120211333369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120211333369 is an equidigital number, since it uses as much as digits as its factorization.
1120211333369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 1120211333369 in words is "one trillion, one hundred twenty billion, two hundred eleven million, three hundred thirty-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •