Base | Representation |
---|---|
bin | 1100110001011000000100… |
… | …0011011010010000111011 |
3 | 1211201102220220221001201221 |
4 | 3030112001003122100323 |
5 | 3320032330242323444 |
6 | 45510555014052511 |
7 | 2646350043112402 |
oct | 314260103322073 |
9 | 54642826831657 |
10 | 14042413245499 |
11 | 45243992127a1 |
12 | 16a961b94a137 |
13 | 7ab269c7c012 |
14 | 367929346639 |
15 | 19541e6c5a84 |
hex | cc5810da43b |
14042413245499 has 8 divisors (see below), whose sum is σ = 14452473510720. Its totient is φ = 13638088089096.
The previous prime is 14042413245491. The next prime is 14042413245529. The reversal of 14042413245499 is 99454231424041.
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 14042413245499 - 23 = 14042413245491 is a prime.
It is a super-4 number, since 4×140424132454994 (a number of 54 digits) contains 4444 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14042413245491) 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, 1433772237 + ... + 1433782030.
It is an arithmetic number, because the mean of its divisors is an integer number (1806559188840).
Almost surely, 214042413245499 is an apocalyptic number.
14042413245499 is a deficient number, since it is larger than the sum of its proper divisors (410060265221).
14042413245499 is an equidigital number, since it uses as much as digits as its factorization.
14042413245499 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2867554409.
The product of its (nonzero) digits is 4976640, while the sum is 52.
The spelling of 14042413245499 in words is "fourteen trillion, forty-two billion, four hundred thirteen million, two hundred forty-five thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •