Base | Representation |
---|---|
bin | 1011000001100010010100… |
… | …1010000110000101111101 |
3 | 1120220202110210122121120211 |
4 | 2300120211022012011331 |
5 | 3042042322401101301 |
6 | 41440153100312421 |
7 | 2360500126340614 |
oct | 260304512060575 |
9 | 46822423577524 |
10 | 12121021112701 |
11 | 3953550473016 |
12 | 1439175542711 |
13 | 69c0132c6b47 |
14 | 2dc9367aa87b |
15 | 160467878051 |
hex | b062528617d |
12121021112701 has 2 divisors, whose sum is σ = 12121021112702. Its totient is φ = 12121021112700.
The previous prime is 12121021112677. The next prime is 12121021112737. The reversal of 12121021112701 is 10721112012121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11606252172025 + 514768940676 = 3406795^2 + 717474^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12121021112701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12121021112771) 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 as a sum of consecutive naturals, namely, 6060510556350 + 6060510556351.
It is an arithmetic number, because the mean of its divisors is an integer number (6060510556351).
Almost surely, 212121021112701 is an apocalyptic number.
It is an amenable number.
12121021112701 is a deficient number, since it is larger than the sum of its proper divisors (1).
12121021112701 is an equidigital number, since it uses as much as digits as its factorization.
12121021112701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 12121021112701 its reverse (10721112012121), we get a palindrome (22842133124822).
The spelling of 12121021112701 in words is "twelve trillion, one hundred twenty-one billion, twenty-one million, one hundred twelve thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •