Base | Representation |
---|---|
bin | 1100111101000001001001… |
… | …1110001001000110001001 |
3 | 1212102120011211122022211121 |
4 | 3033100102132021012021 |
5 | 3331321434342220001 |
6 | 50142513355555241 |
7 | 2666660323546561 |
oct | 317202236110611 |
9 | 55376154568747 |
10 | 14242421445001 |
11 | 45a11a4674342 |
12 | 172033a15bb21 |
13 | 7c4092bac369 |
14 | 3734a055dda1 |
15 | 19a7287196a1 |
hex | cf412789189 |
14242421445001 has 8 divisors (see below), whose sum is σ = 14455309325760. Its totient is φ = 14029542812208.
The previous prime is 14242421444957. The next prime is 14242421445029. The reversal of 14242421445001 is 10054412424241.
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 14242421445001 - 243 = 5446328422793 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14242422445001) 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, 822675 + ... + 5400151.
It is an arithmetic number, because the mean of its divisors is an integer number (1806913665720).
Almost surely, 214242421445001 is an apocalyptic number.
It is an amenable number.
14242421445001 is a deficient number, since it is larger than the sum of its proper divisors (212887880759).
14242421445001 is an equidigital number, since it uses as much as digits as its factorization.
14242421445001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4623983.
The product of its (nonzero) digits is 40960, while the sum is 34.
Adding to 14242421445001 its reverse (10054412424241), we get a palindrome (24296833869242).
The spelling of 14242421445001 in words is "fourteen trillion, two hundred forty-two billion, four hundred twenty-one million, four hundred forty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •