Base | Representation |
---|---|
bin | 1101001000110000110101… |
… | …1110100001000101100101 |
3 | 1220010212000012200212121121 |
4 | 3102030031132201011211 |
5 | 3343123210441320401 |
6 | 50415324022413541 |
7 | 3020362524516664 |
oct | 322141536410545 |
9 | 56125005625547 |
10 | 14444201120101 |
11 | 4669829a77805 |
12 | 17534718912b1 |
13 | 80a10bb2330c |
14 | 37d162b46ddb |
15 | 1a0ad802eca1 |
hex | d230d7a1165 |
14444201120101 has 2 divisors, whose sum is σ = 14444201120102. Its totient is φ = 14444201120100.
The previous prime is 14444201120081. The next prime is 14444201120113. The reversal of 14444201120101 is 10102110244441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8589301424001 + 5854899696100 = 2930751^2 + 2419690^2 .
It is an emirp because it is prime and its reverse (10102110244441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14444201120101 - 27 = 14444201119973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14444201120161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7222100560050 + 7222100560051.
It is an arithmetic number, because the mean of its divisors is an integer number (7222100560051).
Almost surely, 214444201120101 is an apocalyptic number.
It is an amenable number.
14444201120101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14444201120101 is an equidigital number, since it uses as much as digits as its factorization.
14444201120101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1024, while the sum is 25.
Adding to 14444201120101 its reverse (10102110244441), we get a palindrome (24546311364542).
The spelling of 14444201120101 in words is "fourteen trillion, four hundred forty-four billion, two hundred one million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •