Base | Representation |
---|---|
bin | 1101001010000010110110… |
… | …0101010010010101110101 |
3 | 1220012221211100221121220202 |
4 | 3102200231211102111311 |
5 | 3344003301414231401 |
6 | 50433404240010245 |
7 | 3022102166156543 |
oct | 322405545222565 |
9 | 56187740847822 |
10 | 14466214602101 |
11 | 46780a6011639 |
12 | 1757796000985 |
13 | 80c2096b5a02 |
14 | 3802505d6d93 |
15 | 1a147592306b |
hex | d282d952575 |
14466214602101 has 2 divisors, whose sum is σ = 14466214602102. Its totient is φ = 14466214602100.
The previous prime is 14466214602089. The next prime is 14466214602127. The reversal of 14466214602101 is 10120641266441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14401190112100 + 65024490001 = 3794890^2 + 254999^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14466214602101 is a prime.
It is a super-2 number, since 2×144662146021012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14466214602001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7233107301050 + 7233107301051.
It is an arithmetic number, because the mean of its divisors is an integer number (7233107301051).
Almost surely, 214466214602101 is an apocalyptic number.
It is an amenable number.
14466214602101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14466214602101 is an equidigital number, since it uses as much as digits as its factorization.
14466214602101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 38.
Adding to 14466214602101 its reverse (10120641266441), we get a palindrome (24586855868542).
The spelling of 14466214602101 in words is "fourteen trillion, four hundred sixty-six billion, two hundred fourteen million, six hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •