Base | Representation |
---|---|
bin | 10001101001110010011… |
… | …010001001000101000011 |
3 | 11021222020001002220022021 |
4 | 101221302122021011003 |
5 | 124333412124424102 |
6 | 2325142432022311 |
7 | 153433516563154 |
oct | 21516232110503 |
9 | 4258201086267 |
10 | 1213100233027 |
11 | 428522502061 |
12 | 177134991997 |
13 | 8a519682297 |
14 | 42a0030592b |
15 | 2184ed3b137 |
hex | 11a72689143 |
1213100233027 has 2 divisors, whose sum is σ = 1213100233028. Its totient is φ = 1213100233026.
The previous prime is 1213100232979. The next prime is 1213100233031. The reversal of 1213100233027 is 7203320013121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1213100233027 - 27 = 1213100232899 is a prime.
It is a super-2 number, since 2×12131002330272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1213100232992 and 1213100233010.
It is not a weakly prime, because it can be changed into another prime (1213100233067) 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, 606550116513 + 606550116514.
It is an arithmetic number, because the mean of its divisors is an integer number (606550116514).
Almost surely, 21213100233027 is an apocalyptic number.
1213100233027 is a deficient number, since it is larger than the sum of its proper divisors (1).
1213100233027 is an equidigital number, since it uses as much as digits as its factorization.
1213100233027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 25.
Adding to 1213100233027 its reverse (7203320013121), we get a palindrome (8416420246148).
The spelling of 1213100233027 in words is "one trillion, two hundred thirteen billion, one hundred million, two hundred thirty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •