Base | Representation |
---|---|
bin | 1100111010110111101001… |
… | …1100110110001010101001 |
3 | 1212022000220111120010201001 |
4 | 3032231322130312022221 |
5 | 3330220341333330441 |
6 | 50113531033555001 |
7 | 2664212545110631 |
oct | 316557234661251 |
9 | 55260814503631 |
10 | 14205511230121 |
11 | 4587583830622 |
12 | 1715158b75a61 |
13 | 7c075ccb9523 |
14 | 37179c48b6c1 |
15 | 1997b810e731 |
hex | ceb7a7362a9 |
14205511230121 has 8 divisors (see below), whose sum is σ = 14289131049984. Its totient is φ = 14121908732880.
The previous prime is 14205511230107. The next prime is 14205511230149. The reversal of 14205511230121 is 12103211550241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14205511230121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14205511230121.
It is not an unprimeable number, because it can be changed into a prime (14205511230191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2683881 + ... + 5967766.
It is an arithmetic number, because the mean of its divisors is an integer number (1786141381248).
Almost surely, 214205511230121 is an apocalyptic number.
It is an amenable number.
14205511230121 is a deficient number, since it is larger than the sum of its proper divisors (83619819863).
14205511230121 is an equidigital number, since it uses as much as digits as its factorization.
14205511230121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8661311.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 14205511230121 its reverse (12103211550241), we get a palindrome (26308722780362).
The spelling of 14205511230121 in words is "fourteen trillion, two hundred five billion, five hundred eleven million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •