Base | Representation |
---|---|
bin | 110000000111100000… |
… | …1010100111010000001 |
3 | 100212201022220220112202 |
4 | 1200033001110322001 |
5 | 3143110243033441 |
6 | 115245242402545 |
7 | 10315433613302 |
oct | 1401701247201 |
9 | 325638826482 |
10 | 103331221121 |
11 | 3a905864907 |
12 | 18039500455 |
13 | 9989a037bb |
14 | 50036467a9 |
15 | 2a4b90819b |
hex | 180f054e81 |
103331221121 has 4 divisors (see below), whose sum is σ = 103471047600. Its totient is φ = 103191394644.
The previous prime is 103331221039. The next prime is 103331221141. The reversal of 103331221121 is 121122133301.
It is a happy number.
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 103331221121 - 226 = 103264112257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103331221093 and 103331221102.
It is not an unprimeable number, because it can be changed into a prime (103331221141) 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, 69912131 + ... + 69913608.
It is an arithmetic number, because the mean of its divisors is an integer number (25867761900).
Almost surely, 2103331221121 is an apocalyptic number.
It is an amenable number.
103331221121 is a deficient number, since it is larger than the sum of its proper divisors (139826479).
103331221121 is an equidigital number, since it uses as much as digits as its factorization.
103331221121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139826478.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 103331221121 its reverse (121122133301), we get a palindrome (224453354422).
The spelling of 103331221121 in words is "one hundred three billion, three hundred thirty-one million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •