Base | Representation |
---|---|
bin | 1100111100111000100001… |
… | …0110001011000011000010 |
3 | 1212102100012100011000011020 |
4 | 3033032020112023003002 |
5 | 3331302213122200114 |
6 | 50141451415130310 |
7 | 2666546024465031 |
oct | 317161026130302 |
9 | 55370170130136 |
10 | 14240104100034 |
11 | 45a021558680a |
12 | 171b9b2073996 |
13 | 7c3ab3a73417 |
14 | 373320898718 |
15 | 19a64006daa9 |
hex | cf38858b0c2 |
14240104100034 has 8 divisors (see below), whose sum is σ = 28480208200080. Its totient is φ = 4746701366676.
The previous prime is 14240104100017. The next prime is 14240104100153. The reversal of 14240104100034 is 43000140104241.
It is a sphenic number, since it is the product of 3 distinct primes.
14240104100034 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 14240104099977 and 14240104100013.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1186675341664 + ... + 1186675341675.
It is an arithmetic number, because the mean of its divisors is an integer number (3560026025010).
Almost surely, 214240104100034 is an apocalyptic number.
14240104100034 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14240104100034 is a wasteful number, since it uses less digits than its factorization.
14240104100034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2373350683344.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 14240104100034 its reverse (43000140104241), we get a palindrome (57240244204275).
The spelling of 14240104100034 in words is "fourteen trillion, two hundred forty billion, one hundred four million, one hundred thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •