Base | Representation |
---|---|
bin | 1001111101011001100… |
… | …01001111000001100101 |
3 | 1012201021120120011022012 |
4 | 10332230301033001211 |
5 | 21101311424113013 |
6 | 421112135044005 |
7 | 33503026353662 |
oct | 4765461170145 |
9 | 1181246504265 |
10 | 342201004133 |
11 | 12214360031a |
12 | 563a2510605 |
13 | 26366ba4881 |
14 | 127c3b6ca69 |
15 | 8d7c5101a8 |
hex | 4facc4f065 |
342201004133 has 2 divisors, whose sum is σ = 342201004134. Its totient is φ = 342201004132.
The previous prime is 342201004109. The next prime is 342201004157. The reversal of 342201004133 is 331400102243.
It is a balanced prime because it is at equal distance from previous prime (342201004109) and next prime (342201004157).
It can be written as a sum of positive squares in only one way, i.e., 310702563649 + 31498440484 = 557407^2 + 177478^2 .
It is a cyclic number.
It is not a de Polignac number, because 342201004133 - 214 = 342200987749 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 342201004099 and 342201004108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (342201004333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 171100502066 + 171100502067.
It is an arithmetic number, because the mean of its divisors is an integer number (171100502067).
Almost surely, 2342201004133 is an apocalyptic number.
It is an amenable number.
342201004133 is a deficient number, since it is larger than the sum of its proper divisors (1).
342201004133 is an equidigital number, since it uses as much as digits as its factorization.
342201004133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 342201004133 its reverse (331400102243), we get a palindrome (673601106376).
The spelling of 342201004133 in words is "three hundred forty-two billion, two hundred one million, four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •