Base | Representation |
---|---|
bin | 1101001101101000100001… |
… | …1011001100001100101101 |
3 | 1220102211222010010010212122 |
4 | 3103122020123030030231 |
5 | 3401011033231134201 |
6 | 50522002135042325 |
7 | 3026414055256325 |
oct | 323321033141455 |
9 | 56384863103778 |
10 | 14527868224301 |
11 | 46a1263965513 |
12 | 17677218103a5 |
13 | 814c83901973 |
14 | 38321c93c285 |
15 | 1a2d83417e1b |
hex | d36886cc32d |
14527868224301 has 2 divisors, whose sum is σ = 14527868224302. Its totient is φ = 14527868224300.
The previous prime is 14527868224171. The next prime is 14527868224321. The reversal of 14527868224301 is 10342286872541.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9865943820100 + 4661924404201 = 3141010^2 + 2159149^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14527868224301 is a prime.
It is a super-2 number, since 2×145278682243012 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14527868224321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7263934112150 + 7263934112151.
It is an arithmetic number, because the mean of its divisors is an integer number (7263934112151).
Almost surely, 214527868224301 is an apocalyptic number.
It is an amenable number.
14527868224301 is a deficient number, since it is larger than the sum of its proper divisors (1).
14527868224301 is an equidigital number, since it uses as much as digits as its factorization.
14527868224301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5160960, while the sum is 53.
The spelling of 14527868224301 in words is "fourteen trillion, five hundred twenty-seven billion, eight hundred sixty-eight million, two hundred twenty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •