Base | Representation |
---|---|
bin | 1100111101000111011010… |
… | …0110011001111000111101 |
3 | 1212102201111220122110022122 |
4 | 3033101312212121320331 |
5 | 3331333404420120131 |
6 | 50143352205452325 |
7 | 3000050052424103 |
oct | 317216646317075 |
9 | 55381456573278 |
10 | 14244101332541 |
11 | 45a198694a753 |
12 | 17207288710a5 |
13 | 7c429cc36262 |
14 | 3735bd6cbc73 |
15 | 19a7c5e48d7b |
hex | cf476999e3d |
14244101332541 has 4 divisors (see below), whose sum is σ = 14382393578592. Its totient is φ = 14105809086492.
The previous prime is 14244101332481. The next prime is 14244101332579. The reversal of 14244101332541 is 14523310144241.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14244101332541 - 226 = 14244034223677 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14244101338541) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69146122871 + ... + 69146123076.
It is an arithmetic number, because the mean of its divisors is an integer number (3595598394648).
Almost surely, 214244101332541 is an apocalyptic number.
It is an amenable number.
14244101332541 is a deficient number, since it is larger than the sum of its proper divisors (138292246051).
14244101332541 is a wasteful number, since it uses less digits than its factorization.
14244101332541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 138292246050.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 14244101332541 its reverse (14523310144241), we get a palindrome (28767411476782).
The spelling of 14244101332541 in words is "fourteen trillion, two hundred forty-four billion, one hundred one million, three hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •