Base | Representation |
---|---|
bin | 10001101001000011011… |
… | …011110001101000011001 |
3 | 11021220012010011020002211 |
4 | 101221003123301220121 |
5 | 124330303401211441 |
6 | 2324532320155121 |
7 | 153405140045656 |
oct | 21510333615031 |
9 | 4256163136084 |
10 | 1212312132121 |
11 | 4281586591a2 |
12 | 176b54a68aa1 |
13 | 8a42230749c |
14 | 42967796c2d |
15 | 21805a64a81 |
hex | 11a436f1a19 |
1212312132121 has 8 divisors (see below), whose sum is σ = 1212743721024. Its totient is φ = 1211880621840.
The previous prime is 1212312132107. The next prime is 1212312132131.
It is a happy number.
1212312132121 is nontrivially palindromic in base 10.
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 1212312132121 - 27 = 1212312131993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1212312132092 and 1212312132101.
It is not an unprimeable number, because it can be changed into a prime (1212312132131) 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, 53699766 + ... + 53722336.
It is an arithmetic number, because the mean of its divisors is an integer number (151592965128).
Almost surely, 21212312132121 is an apocalyptic number.
It is an amenable number.
1212312132121 is a deficient number, since it is larger than the sum of its proper divisors (431588903).
1212312132121 is a wasteful number, since it uses less digits than its factorization.
1212312132121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39311.
The product of its digits is 288, while the sum is 22.
The spelling of 1212312132121 in words is "one trillion, two hundred twelve billion, three hundred twelve million, one hundred thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •