Base | Representation |
---|---|
bin | 10011000010101011… |
… | …01001111001111011 |
3 | 222101110101021021111 |
4 | 21201111221321323 |
5 | 131414042014321 |
6 | 4410230221151 |
7 | 511223035153 |
oct | 114125517173 |
9 | 28343337244 |
10 | 10223001211 |
11 | 4376688135 |
12 | 1b937b47b7 |
13 | c6bc68c57 |
14 | 6cda11763 |
15 | 3ec75c5e1 |
hex | 261569e7b |
10223001211 has 4 divisors (see below), whose sum is σ = 10225405800. Its totient is φ = 10220596624.
The previous prime is 10223001209. The next prime is 10223001227. The reversal of 10223001211 is 11210032201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11210032201 = 96821 ⋅115781.
It is a cyclic number.
It is not a de Polignac number, because 10223001211 - 21 = 10223001209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10223001191 and 10223001200.
It is not an unprimeable number, because it can be changed into a prime (10223001911) 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 in 3 ways as a sum of consecutive naturals, for example, 1195906 + ... + 1204423.
It is an arithmetic number, because the mean of its divisors is an integer number (2556351450).
Almost surely, 210223001211 is an apocalyptic number.
10223001211 is a deficient number, since it is larger than the sum of its proper divisors (2404589).
10223001211 is an equidigital number, since it uses as much as digits as its factorization.
10223001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2404588.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 10223001211 its reverse (11210032201), we get a palindrome (21433033412).
The spelling of 10223001211 in words is "ten billion, two hundred twenty-three million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •