Base | Representation |
---|---|
bin | 1001111101001111000… |
… | …11100000111000111101 |
3 | 1012201001110221120022001 |
4 | 10332213203200320331 |
5 | 21101122030134323 |
6 | 421055332022301 |
7 | 33500614643512 |
oct | 4764743407075 |
9 | 1181043846261 |
10 | 342113521213 |
11 | 1220a9189092 |
12 | 56379161991 |
13 | 26351a24529 |
14 | 127b62b9309 |
15 | 8d749ce3ad |
hex | 4fa78e0e3d |
342113521213 has 4 divisors (see below), whose sum is σ = 342196421760. Its totient is φ = 342030620668.
The previous prime is 342113521201. The next prime is 342113521279. The reversal of 342113521213 is 312125311243.
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 342113521213 - 233 = 333523586621 is a prime.
It is a super-2 number, since 2×3421135212132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (342113522213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 41444083 + ... + 41452336.
It is an arithmetic number, because the mean of its divisors is an integer number (85549105440).
Almost surely, 2342113521213 is an apocalyptic number.
It is an amenable number.
342113521213 is a deficient number, since it is larger than the sum of its proper divisors (82900547).
342113521213 is an equidigital number, since it uses as much as digits as its factorization.
342113521213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82900546.
The product of its digits is 4320, while the sum is 28.
Adding to 342113521213 its reverse (312125311243), we get a palindrome (654238832456).
The spelling of 342113521213 in words is "three hundred forty-two billion, one hundred thirteen million, five hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •