Base | Representation |
---|---|
bin | 1001111101010000101… |
… | …01111111101011010001 |
3 | 1012201002101211212222021 |
4 | 10332220111333223101 |
5 | 21101133422121023 |
6 | 421100523411441 |
7 | 33501135300535 |
oct | 4765025775321 |
9 | 1181071755867 |
10 | 342126754513 |
11 | 1221056a74a5 |
12 | 56381683b81 |
13 | 263546a899b |
14 | 127b7d61bc5 |
15 | 8d75c4535d |
hex | 4fa857fad1 |
342126754513 has 4 divisors (see below), whose sum is σ = 342177051888. Its totient is φ = 342076457140.
The previous prime is 342126754483. The next prime is 342126754547. The reversal of 342126754513 is 315457621243.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 342126754513 - 221 = 342124657361 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 342126754513.
It is not an unprimeable number, because it can be changed into a prime (342126754573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25138483 + ... + 25152088.
It is an arithmetic number, because the mean of its divisors is an integer number (85544262972).
Almost surely, 2342126754513 is an apocalyptic number.
It is an amenable number.
342126754513 is a deficient number, since it is larger than the sum of its proper divisors (50297375).
342126754513 is an equidigital number, since it uses as much as digits as its factorization.
342126754513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50297374.
The product of its digits is 604800, while the sum is 43.
The spelling of 342126754513 in words is "three hundred forty-two billion, one hundred twenty-six million, seven hundred fifty-four thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •