Base | Representation |
---|---|
bin | 100100000100010… |
… | …1000100110100011 |
3 | 10010100020200212111 |
4 | 1020020220212203 |
5 | 4434304114021 |
6 | 320031140151 |
7 | 41663503654 |
oct | 11010504643 |
9 | 3110220774 |
10 | 1210223011 |
11 | 571159508 |
12 | 299374657 |
13 | 1639636ba |
14 | b6a3152b |
15 | 713a98e1 |
hex | 482289a3 |
1210223011 has 2 divisors, whose sum is σ = 1210223012. Its totient is φ = 1210223010.
The previous prime is 1210222997. The next prime is 1210223129. The reversal of 1210223011 is 1103220121.
It is a weak prime.
It is an emirp because it is prime and its reverse (1103220121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1210223011 - 225 = 1176668579 is a prime.
It is a super-2 number, since 2×12102230112 = 2929279472707812242, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210222982 and 1210223000.
It is not a weakly prime, because it can be changed into another prime (1210293011) 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, 605111505 + 605111506.
It is an arithmetic number, because the mean of its divisors is an integer number (605111506).
Almost surely, 21210223011 is an apocalyptic number.
1210223011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210223011 is an equidigital number, since it uses as much as digits as its factorization.
1210223011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1210223011 is about 34788.2596719066. The cubic root of 1210223011 is about 1065.6676985909.
Adding to 1210223011 its reverse (1103220121), we get a palindrome (2313443132).
The spelling of 1210223011 in words is "one billion, two hundred ten million, two hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •