Base | Representation |
---|---|
bin | 10011000001100111… |
… | …10010001101011101 |
3 | 222100211200011202011 |
4 | 21200303302031131 |
5 | 131404303403313 |
6 | 4405312031221 |
7 | 511054415212 |
oct | 114063621535 |
9 | 28324604664 |
10 | 10214122333 |
11 | 4371673318 |
12 | 1b90832511 |
13 | c6a17a78c |
14 | 6cc77db09 |
15 | 3ebaa693d |
hex | 260cf235d |
10214122333 has 2 divisors, whose sum is σ = 10214122334. Its totient is φ = 10214122332.
The previous prime is 10214122313. The next prime is 10214122349. The reversal of 10214122333 is 33322141201.
10214122333 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7875142564 + 2338979769 = 88742^2 + 48363^2 .
It is a cyclic number.
It is not a de Polignac number, because 10214122333 - 229 = 9677251421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10214122313) 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, 5107061166 + 5107061167.
It is an arithmetic number, because the mean of its divisors is an integer number (5107061167).
Almost surely, 210214122333 is an apocalyptic number.
It is an amenable number.
10214122333 is a deficient number, since it is larger than the sum of its proper divisors (1).
10214122333 is an equidigital number, since it uses as much as digits as its factorization.
10214122333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 10214122333 its reverse (33322141201), we get a palindrome (43536263534).
The spelling of 10214122333 in words is "ten billion, two hundred fourteen million, one hundred twenty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •