Base | Representation |
---|---|
bin | 1101000011100100101100… |
… | …0111101100101001010111 |
3 | 1212211022212111020010000011 |
4 | 3100321023013230221113 |
5 | 3340143110444343221 |
6 | 50310340444101051 |
7 | 3011055204225526 |
oct | 320711307545127 |
9 | 55738774203004 |
10 | 14355041012311 |
11 | 4634a3646410a |
12 | 173a12a234787 |
13 | 8018a001069c |
14 | 378b055da4bd |
15 | 19d61a7aa1e1 |
hex | d0e4b1eca57 |
14355041012311 has 8 divisors (see below), whose sum is σ = 14688960693264. Its totient is φ = 14021125036800.
The previous prime is 14355041012287. The next prime is 14355041012353. The reversal of 14355041012311 is 11321014055341.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14355041012311 - 223 = 14355032623703 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 (14355041012371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7872711 + ... + 9523111.
It is an arithmetic number, because the mean of its divisors is an integer number (1836120086658).
Almost surely, 214355041012311 is an apocalyptic number.
14355041012311 is a deficient number, since it is larger than the sum of its proper divisors (333919680953).
14355041012311 is a wasteful number, since it uses less digits than its factorization.
14355041012311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852721.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 14355041012311 its reverse (11321014055341), we get a palindrome (25676055067652).
The spelling of 14355041012311 in words is "fourteen trillion, three hundred fifty-five billion, forty-one million, twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •