Base | Representation |
---|---|
bin | 1101000000111110011001… |
… | …1000110100111110110001 |
3 | 1212200001122110210100102121 |
4 | 3100033212120310332301 |
5 | 3333430200220043441 |
6 | 50234035124514241 |
7 | 3004615041212440 |
oct | 320174630647661 |
9 | 55601573710377 |
10 | 14310401331121 |
11 | 4618009530a05 |
12 | 173155054b981 |
13 | 7ca60795944c |
14 | 3768acb62d57 |
15 | 19c3a67e2dd1 |
hex | d03e6634fb1 |
14310401331121 has 8 divisors (see below), whose sum is σ = 16882316777984. Its totient is φ = 11870378984160.
The previous prime is 14310401331119. The next prime is 14310401331167. The reversal of 14310401331121 is 12113310401341.
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 14310401331121 - 21 = 14310401331119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14310401331181) 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, 32973274740 + ... + 32973275173.
It is an arithmetic number, because the mean of its divisors is an integer number (2110289597248).
Almost surely, 214310401331121 is an apocalyptic number.
It is an amenable number.
14310401331121 is a deficient number, since it is larger than the sum of its proper divisors (2571915446863).
14310401331121 is an equidigital number, since it uses as much as digits as its factorization.
14310401331121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65946549951.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 14310401331121 its reverse (12113310401341), we get a palindrome (26423711732462).
The spelling of 14310401331121 in words is "fourteen trillion, three hundred ten billion, four hundred one million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •