Base | Representation |
---|---|
bin | 1011000001100111100111… |
… | …1111100101101111101001 |
3 | 1120220220010222212020001112 |
4 | 2300121321333211233221 |
5 | 3042103231233001441 |
6 | 41440550223000105 |
7 | 2360550321305015 |
oct | 260317177455751 |
9 | 46826128766045 |
10 | 12122444422121 |
11 | 39541109324a0 |
12 | 14394b2139035 |
13 | 69c1ac147177 |
14 | 2dca2d829545 |
15 | 1604ec7c44eb |
hex | b0679fe5be9 |
12122444422121 has 8 divisors (see below), whose sum is σ = 13224511511904. Its totient is φ = 11020381780320.
The previous prime is 12122444422117. The next prime is 12122444422139.
12122444422121 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12122444422121 - 22 = 12122444422117 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12122444422421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7458650 + ... + 8937356.
It is an arithmetic number, because the mean of its divisors is an integer number (1653063938988).
Almost surely, 212122444422121 is an apocalyptic number.
12122444422121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12122444422121 is a deficient number, since it is larger than the sum of its proper divisors (1102067089783).
12122444422121 is a wasteful number, since it uses less digits than its factorization.
12122444422121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2223991.
The product of its digits is 16384, while the sum is 32.
It can be divided in two parts, 1212244 and 4422121, that added together give a palindrome (5634365).
The spelling of 12122444422121 in words is "twelve trillion, one hundred twenty-two billion, four hundred forty-four million, four hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •