Base | Representation |
---|---|
bin | 1110010001100010001… |
… | …1100110010101100001 |
3 | 212102222011022212200101 |
4 | 3210120203212111201 |
5 | 13004210112333441 |
6 | 304353241222401 |
7 | 23500623065041 |
oct | 3443043462541 |
9 | 772864285611 |
10 | 245225121121 |
11 | 94aaa208062 |
12 | 3b639491a01 |
13 | 1a180a71986 |
14 | bc245d1721 |
15 | 65a3a30231 |
hex | 39188e6561 |
245225121121 has 2 divisors, whose sum is σ = 245225121122. Its totient is φ = 245225121120.
The previous prime is 245225121107. The next prime is 245225121139. The reversal of 245225121121 is 121121522542.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 222490512721 + 22734608400 = 471689^2 + 150780^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245225121121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 245225121121.
It is not a weakly prime, because it can be changed into another prime (245225121191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122612560560 + 122612560561.
It is an arithmetic number, because the mean of its divisors is an integer number (122612560561).
Almost surely, 2245225121121 is an apocalyptic number.
It is an amenable number.
245225121121 is a deficient number, since it is larger than the sum of its proper divisors (1).
245225121121 is an equidigital number, since it uses as much as digits as its factorization.
245225121121 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3200, while the sum is 28.
Adding to 245225121121 its reverse (121121522542), we get a palindrome (366346643663).
The spelling of 245225121121 in words is "two hundred forty-five billion, two hundred twenty-five million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •