Base | Representation |
---|---|
bin | 110000000111011110… |
… | …1100001000010000101 |
3 | 100212201021001011022011 |
4 | 1200032331201002011 |
5 | 3143110014102323 |
6 | 115245205134221 |
7 | 10315422253111 |
oct | 1401675410205 |
9 | 325637034264 |
10 | 103330222213 |
11 | 3a905242369 |
12 | 180390ba371 |
13 | 9989743c2a |
14 | 5003466741 |
15 | 2a4b7ac20d |
hex | 180ef61085 |
103330222213 has 4 divisors (see below), whose sum is σ = 103611776320. Its totient is φ = 103048668108.
The previous prime is 103330222201. The next prime is 103330222279. The reversal of 103330222213 is 312222033301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 312222033301 = 4243 ⋅73585207.
It is a cyclic number.
It is not a de Polignac number, because 103330222213 - 225 = 103296667781 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103330222913) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 140776503 + ... + 140777236.
It is an arithmetic number, because the mean of its divisors is an integer number (25902944080).
Almost surely, 2103330222213 is an apocalyptic number.
It is an amenable number.
103330222213 is a deficient number, since it is larger than the sum of its proper divisors (281554107).
103330222213 is an equidigital number, since it uses as much as digits as its factorization.
103330222213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281554106.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 103330222213 its reverse (312222033301), we get a palindrome (415552255514).
The spelling of 103330222213 in words is "one hundred three billion, three hundred thirty million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •