Base | Representation |
---|---|
bin | 111000100111111110… |
… | …1000111110101001101 |
3 | 102121212112210210122101 |
4 | 1301033331013311031 |
5 | 3443014212212323 |
6 | 131510144515101 |
7 | 11533242154123 |
oct | 1611775076515 |
9 | 377775723571 |
10 | 121600507213 |
11 | 47630352959 |
12 | 1b69791ba91 |
13 | b60b969c63 |
14 | 5c57b2d913 |
15 | 326a754dad |
hex | 1c4ff47d4d |
121600507213 has 8 divisors (see below), whose sum is σ = 121781354040. Its totient is φ = 121419790080.
The previous prime is 121600507211. The next prime is 121600507241. The reversal of 121600507213 is 312705006121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 58981951044 + 62618556169 = 242862^2 + 250237^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121600507213 - 21 = 121600507211 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 (121600507211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1931553 + ... + 1993513.
It is an arithmetic number, because the mean of its divisors is an integer number (15222669255).
Almost surely, 2121600507213 is an apocalyptic number.
It is an amenable number.
121600507213 is a deficient number, since it is larger than the sum of its proper divisors (180846827).
121600507213 is a wasteful number, since it uses less digits than its factorization.
121600507213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64847.
The product of its (nonzero) digits is 2520, while the sum is 28.
The spelling of 121600507213 in words is "one hundred twenty-one billion, six hundred million, five hundred seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •