Base | Representation |
---|---|
bin | 111000011100011001… |
… | …1000101101110110001 |
3 | 102120212110202122120211 |
4 | 1300320303011232301 |
5 | 3441220233014301 |
6 | 131403425504121 |
7 | 11520514003414 |
oct | 1607063055661 |
9 | 376773678524 |
10 | 121212001201 |
11 | 47451018605 |
12 | 1b5a97a2041 |
13 | b579321245 |
14 | 5c1c2bbb7b |
15 | 32465b2051 |
hex | 1c38cc5bb1 |
121212001201 has 8 divisors (see below), whose sum is σ = 122918295240. Its totient is φ = 119516823552.
The previous prime is 121212001199. The next prime is 121212001217. The reversal of 121212001201 is 102100212121.
It can be written as a sum of positive squares in 4 ways, for example, as 21674906176 + 99537095025 = 147224^2 + 315495^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 121212001201 - 21 = 121212001199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121212001301) 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 7 ways as a sum of consecutive naturals, for example, 2757136 + ... + 2800753.
It is an arithmetic number, because the mean of its divisors is an integer number (15364786905).
Almost surely, 2121212001201 is an apocalyptic number.
It is an amenable number.
121212001201 is a deficient number, since it is larger than the sum of its proper divisors (1706294039).
121212001201 is a wasteful number, since it uses less digits than its factorization.
121212001201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5558195.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 121212001201 its reverse (102100212121), we get a palindrome (223312213322).
The spelling of 121212001201 in words is "one hundred twenty-one billion, two hundred twelve million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •