Base | Representation |
---|---|
bin | 10011000001001111… |
… | …11101100111100011 |
3 | 222100121211201201022 |
4 | 21200213331213203 |
5 | 131403010221311 |
6 | 4405121400055 |
7 | 511016160215 |
oct | 114047754743 |
9 | 28317751638 |
10 | 10211023331 |
11 | 436a946a63 |
12 | 1b8b79902b |
13 | c69634052 |
14 | 6cc1b45b5 |
15 | 3eb6935db |
hex | 2609fd9e3 |
10211023331 has 2 divisors, whose sum is σ = 10211023332. Its totient is φ = 10211023330.
The previous prime is 10211023313. The next prime is 10211023349. The reversal of 10211023331 is 13332011201.
Together with previous prime (10211023313) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (10211023313) and next prime (10211023349).
It is a cyclic number.
It is not a de Polignac number, because 10211023331 - 214 = 10211006947 is a prime.
It is a super-2 number, since 2×102110233312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10211023631) 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, 5105511665 + 5105511666.
It is an arithmetic number, because the mean of its divisors is an integer number (5105511666).
Almost surely, 210211023331 is an apocalyptic number.
10211023331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211023331 is an equidigital number, since it uses as much as digits as its factorization.
10211023331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10211023331 its reverse (13332011201), we get a palindrome (23543034532).
The spelling of 10211023331 in words is "ten billion, two hundred eleven million, twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •