Base | Representation |
---|---|
bin | 110000000100010010… |
… | …1110001000111010101 |
3 | 100212102210220122022202 |
4 | 1200020211301013111 |
5 | 3142400133131313 |
6 | 115230430134245 |
7 | 10312653566531 |
oct | 1401045610725 |
9 | 325383818282 |
10 | 103223333333 |
11 | 3a85a97614a |
12 | 18009351385 |
13 | 997055a983 |
14 | 4dd31a0bc1 |
15 | 2a421e6558 |
hex | 18089711d5 |
103223333333 has 2 divisors, whose sum is σ = 103223333334. Its totient is φ = 103223333332.
The previous prime is 103223333329. The next prime is 103223333341. The reversal of 103223333333 is 333333322301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80359776484 + 22863556849 = 283478^2 + 151207^2 .
It is a cyclic number.
It is not a de Polignac number, because 103223333333 - 22 = 103223333329 is a prime.
103223333333 is a modest number, since divided by 333333 gives 103223 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 103223333296 and 103223333305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103223333383) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51611666666 + 51611666667.
It is an arithmetic number, because the mean of its divisors is an integer number (51611666667).
Almost surely, 2103223333333 is an apocalyptic number.
It is an amenable number.
103223333333 is a deficient number, since it is larger than the sum of its proper divisors (1).
103223333333 is an equidigital number, since it uses as much as digits as its factorization.
103223333333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26244, while the sum is 29.
Adding to 103223333333 its reverse (333333322301), we get a palindrome (436556655634).
The spelling of 103223333333 in words is "one hundred three billion, two hundred twenty-three million, three hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •