Base | Representation |
---|---|
bin | 1100110000110010000010… |
… | …0011000100011010001001 |
3 | 1211200110120102211211120221 |
4 | 3030030200203010122021 |
5 | 3314400423240020131 |
6 | 45502150003150041 |
7 | 2645536046612650 |
oct | 314144043043211 |
9 | 54613512754527 |
10 | 14032204220041 |
11 | 452002a510877 |
12 | 16a7650975321 |
13 | 7aa300b97457 |
14 | 36723b532197 |
15 | 1950232c9411 |
hex | cc3208c4689 |
14032204220041 has 8 divisors (see below), whose sum is σ = 16256487081344. Its totient is φ = 11862841923360.
The previous prime is 14032204220003. The next prime is 14032204220081. The reversal of 14032204220041 is 14002240223041.
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 14032204220041 - 29 = 14032204219529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14032204219988 and 14032204220015.
It is not an unprimeable number, because it can be changed into a prime (14032204220081) 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, 13730140605 + ... + 13730141626.
It is an arithmetic number, because the mean of its divisors is an integer number (2032060885168).
Almost surely, 214032204220041 is an apocalyptic number.
It is an amenable number.
14032204220041 is a deficient number, since it is larger than the sum of its proper divisors (2224282861303).
14032204220041 is an equidigital number, since it uses as much as digits as its factorization.
14032204220041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27460282311.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 14032204220041 its reverse (14002240223041), we get a palindrome (28034444443082).
The spelling of 14032204220041 in words is "fourteen trillion, thirty-two billion, two hundred four million, two hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •