Base | Representation |
---|---|
bin | 1100110101010111101100… |
… | …0101001100000110010001 |
3 | 1211222000001010012122102201 |
4 | 3031111323011030012101 |
5 | 3322143343311301301 |
6 | 50002304023243201 |
7 | 2654326353265423 |
oct | 315257305140621 |
9 | 54860033178381 |
10 | 14111032525201 |
11 | 4550500a94207 |
12 | 16ba9902a9501 |
13 | 7b48843384c1 |
14 | 36ad98828813 |
15 | 1970d899e201 |
hex | cd57b14c191 |
14111032525201 has 8 divisors (see below), whose sum is σ = 14867851407200. Its totient is φ = 13355626939200.
The previous prime is 14111032525099. The next prime is 14111032525207. The reversal of 14111032525201 is 10252523011141.
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 14111032525201 - 225 = 14110998970769 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 14111032525201.
It is not an unprimeable number, because it can be changed into a prime (14111032525207) 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, 353303496 + ... + 353343433.
It is an arithmetic number, because the mean of its divisors is an integer number (1858481425900).
Almost surely, 214111032525201 is an apocalyptic number.
It is an amenable number.
14111032525201 is a deficient number, since it is larger than the sum of its proper divisors (756818881999).
14111032525201 is a wasteful number, since it uses less digits than its factorization.
14111032525201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706647999.
The product of its (nonzero) digits is 2400, while the sum is 28.
Adding to 14111032525201 its reverse (10252523011141), we get a palindrome (24363555536342).
The spelling of 14111032525201 in words is "fourteen trillion, one hundred eleven billion, thirty-two million, five hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •