Base | Representation |
---|---|
bin | 110000000011111111… |
… | …1100010110000000101 |
3 | 100212102010001120001101 |
4 | 1200013333202300011 |
5 | 3142340102004104 |
6 | 115225431300101 |
7 | 10312502454031 |
oct | 1400777426005 |
9 | 325363046041 |
10 | 103213313029 |
11 | 3a855251802 |
12 | 18005b1a631 |
13 | 996b45cab8 |
14 | 4dd1b131c1 |
15 | 2a413b75a4 |
hex | 1807fe2c05 |
103213313029 has 2 divisors, whose sum is σ = 103213313030. Its totient is φ = 103213313028.
The previous prime is 103213313023. The next prime is 103213313123. The reversal of 103213313029 is 920313312301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72762365025 + 30450948004 = 269745^2 + 174502^2 .
It is an emirp because it is prime and its reverse (920313312301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103213313029 - 25 = 103213312997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103213312988 and 103213313006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103213313023) 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, 51606656514 + 51606656515.
It is an arithmetic number, because the mean of its divisors is an integer number (51606656515).
Almost surely, 2103213313029 is an apocalyptic number.
It is an amenable number.
103213313029 is a deficient number, since it is larger than the sum of its proper divisors (1).
103213313029 is an equidigital number, since it uses as much as digits as its factorization.
103213313029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 103213313029 in words is "one hundred three billion, two hundred thirteen million, three hundred thirteen thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •