Base | Representation |
---|---|
bin | 110000000011101010… |
… | …1001100110101110001 |
3 | 100212101100011121222211 |
4 | 1200013111030311301 |
5 | 3142324231310413 |
6 | 115224353332121 |
7 | 10312306224100 |
oct | 1400725146561 |
9 | 325340147884 |
10 | 103202213233 |
11 | 3a849a60319 |
12 | 18002267041 |
13 | 9969074782 |
14 | 4dd0464037 |
15 | 2a4042383d |
hex | 180754cd71 |
103202213233 has 6 divisors (see below), whose sum is σ = 120051554226. Its totient is φ = 88459039872.
The previous prime is 103202213201. The next prime is 103202213251. The reversal of 103202213233 is 332312202301.
It can be written as a sum of positive squares in only one way, i.e., 84895311424 + 18306901809 = 291368^2 + 135303^2 .
It is not a de Polignac number, because 103202213233 - 25 = 103202213201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103202213533) 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 in 5 ways as a sum of consecutive naturals, for example, 1053083760 + ... + 1053083857.
It is an arithmetic number, because the mean of its divisors is an integer number (20008592371).
Almost surely, 2103202213233 is an apocalyptic number.
It is an amenable number.
103202213233 is a deficient number, since it is larger than the sum of its proper divisors (16849340993).
103202213233 is an equidigital number, since it uses as much as digits as its factorization.
103202213233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2106167631 (or 2106167624 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 103202213233 its reverse (332312202301), we get a palindrome (435514415534).
The spelling of 103202213233 in words is "one hundred three billion, two hundred two million, two hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •