Base | Representation |
---|---|
bin | 11110110111101000101… |
… | …001101101010000110101 |
3 | 21111210111120211100002201 |
4 | 132313220221231100311 |
5 | 234223431430434331 |
6 | 4302304423104501 |
7 | 306155224355260 |
oct | 36675051552065 |
9 | 7453446740081 |
10 | 2121322124341 |
11 | 748714044552 |
12 | 2a31625a2131 |
13 | 125069631a24 |
14 | 7495b635cd7 |
15 | 3a2a9093a61 |
hex | 1ede8a6d435 |
2121322124341 has 16 divisors (see below), whose sum is σ = 2568037803264. Its totient is φ = 1710612175104.
The previous prime is 2121322124309. The next prime is 2121322124351. The reversal of 2121322124341 is 1434212231212.
It is not a de Polignac number, because 2121322124341 - 25 = 2121322124309 is a prime.
It is a super-2 number, since 2×21213221243412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2121322124351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3390210 + ... + 3966883.
It is an arithmetic number, because the mean of its divisors is an integer number (160502362704).
Almost surely, 22121322124341 is an apocalyptic number.
It is an amenable number.
2121322124341 is a deficient number, since it is larger than the sum of its proper divisors (446715678923).
2121322124341 is a wasteful number, since it uses less digits than its factorization.
2121322124341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7359540.
The product of its digits is 4608, while the sum is 28.
Adding to 2121322124341 its reverse (1434212231212), we get a palindrome (3555534355553).
The spelling of 2121322124341 in words is "two trillion, one hundred twenty-one billion, three hundred twenty-two million, one hundred twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •