Base | Representation |
---|---|
bin | 1100110000010000001100… |
… | …1001011010010011001111 |
3 | 1211122121010102012110201201 |
4 | 3030010003021122103033 |
5 | 3314223322440120421 |
6 | 45454044410450331 |
7 | 2645065003650340 |
oct | 314040311322317 |
9 | 54577112173651 |
10 | 14023121020111 |
11 | 4517199263275 |
12 | 16a5936a339a7 |
13 | 7a94b4106438 |
14 | 366a190600c7 |
15 | 194b90b65b91 |
hex | cc10325a4cf |
14023121020111 has 8 divisors (see below), whose sum is σ = 16265624382080. Its totient is φ = 11840417747928.
The previous prime is 14023121020099. The next prime is 14023121020147. The reversal of 14023121020111 is 11102012132041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14023121020111 - 233 = 14014531085519 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 (14023121020411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14950021941 + ... + 14950022878.
It is an arithmetic number, because the mean of its divisors is an integer number (2033203047760).
Almost surely, 214023121020111 is an apocalyptic number.
14023121020111 is a deficient number, since it is larger than the sum of its proper divisors (2242503361969).
14023121020111 is an equidigital number, since it uses as much as digits as its factorization.
14023121020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29900044893.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 14023121020111 its reverse (11102012132041), we get a palindrome (25125133152152).
The spelling of 14023121020111 in words is "fourteen trillion, twenty-three billion, one hundred twenty-one million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •