Base | Representation |
---|---|
bin | 1001111101011010101… |
… | …00010100110111100111 |
3 | 1012201022012212111221002 |
4 | 10332231110110313213 |
5 | 21101321302444421 |
6 | 421113104143515 |
7 | 33503200506110 |
oct | 4765524246747 |
9 | 1181265774832 |
10 | 342210203111 |
11 | 122148813687 |
12 | 563a5607b9b |
13 | 26368a7595a |
14 | 127c5085207 |
15 | 8d7d22ab0b |
hex | 4fad514de7 |
342210203111 has 8 divisors (see below), whose sum is σ = 391101679104. Its totient is φ = 293319803160.
The previous prime is 342210203089. The next prime is 342210203143. The reversal of 342210203111 is 111302012243.
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 342210203111 - 226 = 342143094247 is a prime.
It is a super-2 number, since 2×3422102031112 (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 (342210203011) 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 7 ways as a sum of consecutive naturals, for example, 599366 + ... + 1021596.
It is an arithmetic number, because the mean of its divisors is an integer number (48887709888).
Almost surely, 2342210203111 is an apocalyptic number.
342210203111 is a deficient number, since it is larger than the sum of its proper divisors (48891475993).
342210203111 is a wasteful number, since it uses less digits than its factorization.
342210203111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538021.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 342210203111 its reverse (111302012243), we get a palindrome (453512215354).
The spelling of 342210203111 in words is "three hundred forty-two billion, two hundred ten million, two hundred three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •