Base | Representation |
---|---|
bin | 11110111000101010001… |
… | …110001111101000011101 |
3 | 21111220100020212001111001 |
4 | 132320222032033220131 |
5 | 234233210042040331 |
6 | 4303005522030301 |
7 | 306224413134202 |
oct | 36705216175035 |
9 | 7456306761431 |
10 | 2122422221341 |
11 | 749129015724 |
12 | 2a340aaa8391 |
13 | 1251b35178b6 |
14 | 74a2379bca9 |
15 | 3a320948561 |
hex | 1ee2a38fa1d |
2122422221341 has 8 divisors (see below), whose sum is σ = 2167640129664. Its totient is φ = 2077206812640.
The previous prime is 2122422221323. The next prime is 2122422221389. The reversal of 2122422221341 is 1431222242212.
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 2122422221341 - 215 = 2122422188573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2122422221441) 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 7 ways as a sum of consecutive naturals, for example, 1144161 + ... + 2356681.
It is an arithmetic number, because the mean of its divisors is an integer number (270955016208).
Almost surely, 22122422221341 is an apocalyptic number.
It is an amenable number.
2122422221341 is a deficient number, since it is larger than the sum of its proper divisors (45217908323).
2122422221341 is a wasteful number, since it uses less digits than its factorization.
2122422221341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1249811.
The product of its digits is 6144, while the sum is 28.
Adding to 2122422221341 its reverse (1431222242212), we get a palindrome (3553644463553).
The spelling of 2122422221341 in words is "two trillion, one hundred twenty-two billion, four hundred twenty-two million, two hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •