Base | Representation |
---|---|
bin | 1011011110101001010001… |
… | …1100001110010010010001 |
3 | 1122200120021110110211011221 |
4 | 2313222110130032102101 |
5 | 3123241010202422121 |
6 | 42502015535405041 |
7 | 2441562505553620 |
oct | 267522434162221 |
9 | 48616243424157 |
10 | 12621104342161 |
11 | 4026642407a97 |
12 | 14ba07a383781 |
13 | 70721b765c03 |
14 | 318c16a976b7 |
15 | 16d48594bb41 |
hex | b7a9470e491 |
12621104342161 has 8 divisors (see below), whose sum is σ = 14424155867520. Its totient is φ = 10818061971648.
The previous prime is 12621104342129. The next prime is 12621104342233. The reversal of 12621104342161 is 16124340112621.
It is a happy number.
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 12621104342161 - 25 = 12621104342129 is a prime.
It is a super-3 number, since 3×126211043421613 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (12621104342101) 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, 975945 + ... + 5118073.
It is an arithmetic number, because the mean of its divisors is an integer number (1803019483440).
Almost surely, 212621104342161 is an apocalyptic number.
It is an amenable number.
12621104342161 is a deficient number, since it is larger than the sum of its proper divisors (1803051525359).
12621104342161 is an equidigital number, since it uses as much as digits as its factorization.
12621104342161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4577423.
The product of its (nonzero) digits is 13824, while the sum is 34.
Adding to 12621104342161 its reverse (16124340112621), we get a palindrome (28745444454782).
The spelling of 12621104342161 in words is "twelve trillion, six hundred twenty-one billion, one hundred four million, three hundred forty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •