Base | Representation |
---|---|
bin | 11011000011101001… |
… | …01100101010000001 |
3 | 1101111100102122122212 |
4 | 31201310230222001 |
5 | 214222140344431 |
6 | 10401224511505 |
7 | 1022653602653 |
oct | 154164545201 |
9 | 41440378585 |
10 | 14526106241 |
11 | 6184676689 |
12 | 299491b595 |
13 | 14a660484a |
14 | 9bb3066d3 |
15 | 5a040672b |
hex | 361d2ca81 |
14526106241 has 2 divisors, whose sum is σ = 14526106242. Its totient is φ = 14526106240.
The previous prime is 14526106219. The next prime is 14526106313. The reversal of 14526106241 is 14260162541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13238803600 + 1287302641 = 115060^2 + 35879^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14526106241 is a prime.
It is a super-3 number, since 3×145261062413 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 14526106198 and 14526106207.
It is not a weakly prime, because it can be changed into another prime (14526106211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7263053120 + 7263053121.
It is an arithmetic number, because the mean of its divisors is an integer number (7263053121).
Almost surely, 214526106241 is an apocalyptic number.
It is an amenable number.
14526106241 is a deficient number, since it is larger than the sum of its proper divisors (1).
14526106241 is an equidigital number, since it uses as much as digits as its factorization.
14526106241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 14526106241 its reverse (14260162541), we get a palindrome (28786268782).
The spelling of 14526106241 in words is "fourteen billion, five hundred twenty-six million, one hundred six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •