Base | Representation |
---|---|
bin | 1101000000011100001011… |
… | …0010110111010100110101 |
3 | 1212122011221012122212112022 |
4 | 3100013002302313110311 |
5 | 3333302341321221401 |
6 | 50225515341402525 |
7 | 3004141264226363 |
oct | 320070262672465 |
9 | 55564835585468 |
10 | 14301214242101 |
11 | 4614124675a56 |
12 | 172b807869445 |
13 | 7c97a24c26b7 |
14 | 37627a96a633 |
15 | 19c019eac71b |
hex | d01c2cb7535 |
14301214242101 has 4 divisors (see below), whose sum is σ = 14303757590112. Its totient is φ = 14298670894092.
The previous prime is 14301214242019. The next prime is 14301214242103. The reversal of 14301214242101 is 10124241210341.
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 14301214242101 - 226 = 14301147133237 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 (14301214242103) 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, 1271665571 + ... + 1271676816.
It is an arithmetic number, because the mean of its divisors is an integer number (3575939397528).
Almost surely, 214301214242101 is an apocalyptic number.
It is an amenable number.
14301214242101 is a deficient number, since it is larger than the sum of its proper divisors (2543348011).
14301214242101 is an equidigital number, since it uses as much as digits as its factorization.
14301214242101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2543348010.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 14301214242101 its reverse (10124241210341), we get a palindrome (24425455452442).
The spelling of 14301214242101 in words is "fourteen trillion, three hundred one billion, two hundred fourteen million, two hundred forty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •