Base | Representation |
---|---|
bin | 1100110001111100001000… |
… | …0110010000101000010101 |
3 | 1211202100220121211000022012 |
4 | 3030133002012100220111 |
5 | 3320212142134233401 |
6 | 45515235411514005 |
7 | 2650142000006135 |
oct | 314370206205025 |
9 | 54670817730265 |
10 | 14052094446101 |
11 | 4528506a83028 |
12 | 16ab481bb8905 |
13 | 7ac1508b889a |
14 | 3681a7000ac5 |
15 | 1957d95ae8bb |
hex | cc7c2190a15 |
14052094446101 has 2 divisors, whose sum is σ = 14052094446102. Its totient is φ = 14052094446100.
The previous prime is 14052094446077. The next prime is 14052094446149. The reversal of 14052094446101 is 10164449025041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13233232338001 + 818862108100 = 3637751^2 + 904910^2 .
It is an emirp because it is prime and its reverse (10164449025041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14052094446101 is a prime.
It is a super-2 number, since 2×140520944461012 (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 (14052094440101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026047223050 + 7026047223051.
It is an arithmetic number, because the mean of its divisors is an integer number (7026047223051).
Almost surely, 214052094446101 is an apocalyptic number.
It is an amenable number.
14052094446101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14052094446101 is an equidigital number, since it uses as much as digits as its factorization.
14052094446101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 41.
The spelling of 14052094446101 in words is "fourteen trillion, fifty-two billion, ninety-four million, four hundred forty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •