Base | Representation |
---|---|
bin | 100000110011010101110… |
… | …110010010011101110001 |
3 | 21222111100122010010212002 |
4 | 200303111312102131301 |
5 | 243413000031012041 |
6 | 4443313103143345 |
7 | 321566645212352 |
oct | 40632566223561 |
9 | 7874318103762 |
10 | 2254150641521 |
11 | 799a862a9489 |
12 | 304a525a4b55 |
13 | 13474750985c |
14 | 7b15c629d29 |
15 | 3d9803c659b |
hex | 20cd5d92771 |
2254150641521 has 2 divisors, whose sum is σ = 2254150641522. Its totient is φ = 2254150641520.
The previous prime is 2254150641517. The next prime is 2254150641527. The reversal of 2254150641521 is 1251460514522.
2254150641521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1460982281521 + 793168360000 = 1208711^2 + 890600^2 .
It is a cyclic number.
It is not a de Polignac number, because 2254150641521 - 22 = 2254150641517 is a prime.
It is a super-2 number, since 2×22541506415212 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2254150641527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1127075320760 + 1127075320761.
It is an arithmetic number, because the mean of its divisors is an integer number (1127075320761).
Almost surely, 22254150641521 is an apocalyptic number.
It is an amenable number.
2254150641521 is a deficient number, since it is larger than the sum of its proper divisors (1).
2254150641521 is an equidigital number, since it uses as much as digits as its factorization.
2254150641521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96000, while the sum is 38.
The spelling of 2254150641521 in words is "two trillion, two hundred fifty-four billion, one hundred fifty million, six hundred forty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •