Base | Representation |
---|---|
bin | 10011100010010110001… |
… | …101110111100001010011 |
3 | 11202100100121201010100220 |
4 | 103202112031313201103 |
5 | 133444020300422120 |
6 | 2504431534044123 |
7 | 165665432554416 |
oct | 23422615674123 |
9 | 4670317633326 |
10 | 1342550014035 |
11 | 47841053454a |
12 | 198241349643 |
13 | 997a956aa39 |
14 | 48da06a5b7d |
15 | 24dc9716b40 |
hex | 13896377853 |
1342550014035 has 8 divisors (see below), whose sum is σ = 2148080022480. Its totient is φ = 716026674144.
The previous prime is 1342550014033. The next prime is 1342550014061. The reversal of 1342550014035 is 5304100552431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1342550014035 - 21 = 1342550014033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1342550013987 and 1342550014005.
It is not an unprimeable number, because it can be changed into a prime (1342550014033) 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, 44751667120 + ... + 44751667149.
It is an arithmetic number, because the mean of its divisors is an integer number (268510002810).
Almost surely, 21342550014035 is an apocalyptic number.
1342550014035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1342550014035 is a deficient number, since it is larger than the sum of its proper divisors (805530008445).
1342550014035 is an equidigital number, since it uses as much as digits as its factorization.
1342550014035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89503334277.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 1342550014035 its reverse (5304100552431), we get a palindrome (6646650566466).
The spelling of 1342550014035 in words is "one trillion, three hundred forty-two billion, five hundred fifty million, fourteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •