Base | Representation |
---|---|
bin | 10000001100110000101… |
… | …010101010110001010101 |
3 | 10221102101201200210102212 |
4 | 100030300222222301111 |
5 | 121214330013140034 |
6 | 2211223014243205 |
7 | 143266312361306 |
oct | 20146052526125 |
9 | 3842351623385 |
10 | 1113213021269 |
11 | 39a124802488 |
12 | 15b8b8956505 |
13 | 80c8b34305b |
14 | 3bc462447ad |
15 | 1de559802ce |
hex | 10330aaac55 |
1113213021269 has 2 divisors, whose sum is σ = 1113213021270. Its totient is φ = 1113213021268.
The previous prime is 1113213021211. The next prime is 1113213021287. The reversal of 1113213021269 is 9621203123111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1106152820644 + 7060200625 = 1051738^2 + 84025^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113213021269 - 216 = 1113212955733 is a prime.
It is a super-2 number, since 2×11132130212692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113213023269) 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, 556606510634 + 556606510635.
It is an arithmetic number, because the mean of its divisors is an integer number (556606510635).
Almost surely, 21113213021269 is an apocalyptic number.
It is an amenable number.
1113213021269 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113213021269 is an equidigital number, since it uses as much as digits as its factorization.
1113213021269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The spelling of 1113213021269 in words is "one trillion, one hundred thirteen billion, two hundred thirteen million, twenty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •