Base | Representation |
---|---|
bin | 110000000001010010… |
… | …0011110101000111101 |
3 | 100212011202212020211211 |
4 | 1200002210132220331 |
5 | 3142143304112341 |
6 | 115212421244421 |
7 | 10310316234616 |
oct | 1400244365075 |
9 | 325152766754 |
10 | 103122332221 |
11 | 3a808960557 |
12 | 17b9b563711 |
13 | 99556565bc |
14 | 4dc39ccc0d |
15 | 2a383e5181 |
hex | 180291ea3d |
103122332221 has 4 divisors (see below), whose sum is σ = 103170454912. Its totient is φ = 103074209532.
The previous prime is 103122332207. The next prime is 103122332233. The reversal of 103122332221 is 122233221301.
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.
It is a cyclic number.
It is not a de Polignac number, because 103122332221 - 211 = 103122330173 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103122332192 and 103122332201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103122332251) 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, 24058131 + ... + 24062416.
It is an arithmetic number, because the mean of its divisors is an integer number (25792613728).
Almost surely, 2103122332221 is an apocalyptic number.
It is an amenable number.
103122332221 is a deficient number, since it is larger than the sum of its proper divisors (48122691).
103122332221 is an equidigital number, since it uses as much as digits as its factorization.
103122332221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48122690.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 103122332221 its reverse (122233221301), we get a palindrome (225355553522).
The spelling of 103122332221 in words is "one hundred three billion, one hundred twenty-two million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •