Base | Representation |
---|---|
bin | 110000000011111001… |
… | …1101011001110110001 |
3 | 100212101220012111120022 |
4 | 1200013303223032301 |
5 | 3142333302431113 |
6 | 115225240453225 |
7 | 10312434146051 |
oct | 1400763531661 |
9 | 325356174508 |
10 | 103210202033 |
11 | 3a853517434 |
12 | 18004a7a215 |
13 | 996a910a83 |
14 | 4dd1543561 |
15 | 2a40ea0908 |
hex | 1807ceb3b1 |
103210202033 has 4 divisors (see below), whose sum is σ = 103214541300. Its totient is φ = 103205862768.
The previous prime is 103210202009. The next prime is 103210202063. The reversal of 103210202033 is 330202012301.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 81528523024 + 21681679009 = 285532^2 + 147247^2 .
It is a cyclic number.
It is not a de Polignac number, because 103210202033 - 234 = 86030332849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103210202063) 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, 2133758 + ... + 2181591.
It is an arithmetic number, because the mean of its divisors is an integer number (25803635325).
Almost surely, 2103210202033 is an apocalyptic number.
It is an amenable number.
103210202033 is a deficient number, since it is larger than the sum of its proper divisors (4339267).
103210202033 is an equidigital number, since it uses as much as digits as its factorization.
103210202033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4339266.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 103210202033 its reverse (330202012301), we get a palindrome (433412214334).
The spelling of 103210202033 in words is "one hundred three billion, two hundred ten million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •