Base | Representation |
---|---|
bin | 10001110100111110000… |
… | …001100000110010110101 |
3 | 11100010012202120102112020 |
4 | 101310332001200302311 |
5 | 130033004200410341 |
6 | 2334450034543353 |
7 | 154340163263511 |
oct | 21647601406265 |
9 | 4303182512466 |
10 | 1225106263221 |
11 | 432623602265 |
12 | 179525737b59 |
13 | 8b6b0b48769 |
14 | 4341ca53141 |
15 | 21d03d9d566 |
hex | 11d3e060cb5 |
1225106263221 has 4 divisors (see below), whose sum is σ = 1633475017632. Its totient is φ = 816737508812.
The previous prime is 1225106263163. The next prime is 1225106263237. The reversal of 1225106263221 is 1223626015221.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1225106263221 - 219 = 1225105738933 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1225106263291) 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 in 3 ways as a sum of consecutive naturals, for example, 204184377201 + ... + 204184377206.
It is an arithmetic number, because the mean of its divisors is an integer number (408368754408).
Almost surely, 21225106263221 is an apocalyptic number.
It is an amenable number.
1225106263221 is a deficient number, since it is larger than the sum of its proper divisors (408368754411).
1225106263221 is an equidigital number, since it uses as much as digits as its factorization.
1225106263221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 408368754410.
The product of its (nonzero) digits is 17280, while the sum is 33.
The spelling of 1225106263221 in words is "one trillion, two hundred twenty-five billion, one hundred six million, two hundred sixty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •