Base | Representation |
---|---|
bin | 10011001000011010… |
… | …01001111001111001 |
3 | 222111210220011202201 |
4 | 21210031021321321 |
5 | 132013400322013 |
6 | 4415105230201 |
7 | 512345643316 |
oct | 114415117171 |
9 | 28453804681 |
10 | 10271104633 |
11 | 43a0852a29 |
12 | 1ba7932361 |
13 | c78c0c00a |
14 | 6d6173d0d |
15 | 401ab03dd |
hex | 264349e79 |
10271104633 has 2 divisors, whose sum is σ = 10271104634. Its totient is φ = 10271104632.
The previous prime is 10271104601. The next prime is 10271104661. The reversal of 10271104633 is 33640117201.
10271104633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (10271104661) can be obtained adding 10271104633 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8628180544 + 1642924089 = 92888^2 + 40533^2 .
It is a cyclic number.
It is not a de Polignac number, because 10271104633 - 25 = 10271104601 is a prime.
It is not a weakly prime, because it can be changed into another prime (10271104673) 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, 5135552316 + 5135552317.
It is an arithmetic number, because the mean of its divisors is an integer number (5135552317).
Almost surely, 210271104633 is an apocalyptic number.
It is an amenable number.
10271104633 is a deficient number, since it is larger than the sum of its proper divisors (1).
10271104633 is an equidigital number, since it uses as much as digits as its factorization.
10271104633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 28.
The spelling of 10271104633 in words is "ten billion, two hundred seventy-one million, one hundred four thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •