Base | Representation |
---|---|
bin | 111000101000000111… |
… | …1001101110000110111 |
3 | 102121212212201202122222 |
4 | 1301100033031300313 |
5 | 3443021421000403 |
6 | 131510434312555 |
7 | 11533330366601 |
oct | 1612017156067 |
9 | 377785652588 |
10 | 121605250103 |
11 | 47632aa22a7 |
12 | 1b69942875b |
13 | b60c93a9bc |
14 | 5c58606171 |
15 | 326ad90338 |
hex | 1c503cdc37 |
121605250103 has 4 divisors (see below), whose sum is σ = 121818968160. Its totient is φ = 121391532048.
The previous prime is 121605250087. The next prime is 121605250127. The reversal of 121605250103 is 301052506121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121605250103 - 24 = 121605250087 is a prime.
It is a super-2 number, since 2×1216052501032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121605250183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106858175 + ... + 106859312.
It is an arithmetic number, because the mean of its divisors is an integer number (30454742040).
Almost surely, 2121605250103 is an apocalyptic number.
121605250103 is a deficient number, since it is larger than the sum of its proper divisors (213718057).
121605250103 is an equidigital number, since it uses as much as digits as its factorization.
121605250103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213718056.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 121605250103 its reverse (301052506121), we get a palindrome (422657756224).
The spelling of 121605250103 in words is "one hundred twenty-one billion, six hundred five million, two hundred fifty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •