Base | Representation |
---|---|
bin | 1101001110100101101100… |
… | …0000110100100000110001 |
3 | 1220111102100022110000202221 |
4 | 3103221123000310200301 |
5 | 3401243144232043001 |
6 | 50533315225241041 |
7 | 3030534653643226 |
oct | 323513300644061 |
9 | 56442308400687 |
10 | 14544286206001 |
11 | 46a8219438132 |
12 | 176a944033181 |
13 | 81669c154036 |
14 | 383d391d594d |
15 | 1a34e49751a1 |
hex | d3a5b034831 |
14544286206001 has 2 divisors, whose sum is σ = 14544286206002. Its totient is φ = 14544286206000.
The previous prime is 14544286205983. The next prime is 14544286206011. The reversal of 14544286206001 is 10060268244541.
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., 8540708157601 + 6003578048400 = 2922449^2 + 2450220^2 .
It is a cyclic number.
It is not a de Polignac number, because 14544286206001 - 27 = 14544286205873 is a prime.
It is a super-2 number, since 2×145442862060012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14544286206011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7272143103000 + 7272143103001.
It is an arithmetic number, because the mean of its divisors is an integer number (7272143103001).
Almost surely, 214544286206001 is an apocalyptic number.
It is an amenable number.
14544286206001 is a deficient number, since it is larger than the sum of its proper divisors (1).
14544286206001 is an equidigital number, since it uses as much as digits as its factorization.
14544286206001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 368640, while the sum is 43.
The spelling of 14544286206001 in words is "fourteen trillion, five hundred forty-four billion, two hundred eighty-six million, two hundred six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •