Base | Representation |
---|---|
bin | 100100100001010… |
… | …1011110001010101 |
3 | 10011101212211010022 |
4 | 1021002223301111 |
5 | 10002203042331 |
6 | 321333234525 |
7 | 42240033236 |
oct | 11102536125 |
9 | 3141784108 |
10 | 1225440341 |
11 | 579802514 |
12 | 2a2492a45 |
13 | 166b60c38 |
14 | b8a7308d |
15 | 728b367b |
hex | 490abc55 |
1225440341 has 2 divisors, whose sum is σ = 1225440342. Its totient is φ = 1225440340.
The previous prime is 1225440329. The next prime is 1225440343. The reversal of 1225440341 is 1430445221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 665124100 + 560316241 = 25790^2 + 23671^2 .
It is a cyclic number.
It is not a de Polignac number, because 1225440341 - 26 = 1225440277 is a prime.
Together with 1225440343, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1225440341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1225440343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 612720170 + 612720171.
It is an arithmetic number, because the mean of its divisors is an integer number (612720171).
Almost surely, 21225440341 is an apocalyptic number.
It is an amenable number.
1225440341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1225440341 is an equidigital number, since it uses as much as digits as its factorization.
1225440341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3840, while the sum is 26.
The square root of 1225440341 is about 35006.2900205092. The cubic root of 1225440341 is about 1070.1156718341.
Adding to 1225440341 its reverse (1430445221), we get a palindrome (2655885562).
The spelling of 1225440341 in words is "one billion, two hundred twenty-five million, four hundred forty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •