Base | Representation |
---|---|
bin | 11111110111101101… |
… | …010010101001101101 |
3 | 10021022220010102111101 |
4 | 133313231102221231 |
5 | 1030040434210201 |
6 | 23415402323101 |
7 | 2321006303434 |
oct | 376755225155 |
9 | 107286112441 |
10 | 34220616301 |
11 | 13570711583 |
12 | 67704b9491 |
13 | 32c490b8b1 |
14 | 1928bca11b |
15 | d5442bd01 |
hex | 7f7b52a6d |
34220616301 has 2 divisors, whose sum is σ = 34220616302. Its totient is φ = 34220616300.
The previous prime is 34220616229. The next prime is 34220616329. The reversal of 34220616301 is 10361602243.
It is an a-pointer prime, because the next prime (34220616329) can be obtained adding 34220616301 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33690235401 + 530380900 = 183549^2 + 23030^2 .
It is a cyclic number.
It is not a de Polignac number, because 34220616301 - 27 = 34220616173 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 34220616301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34220610301) 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 as a sum of consecutive naturals, namely, 17110308150 + 17110308151.
It is an arithmetic number, because the mean of its divisors is an integer number (17110308151).
Almost surely, 234220616301 is an apocalyptic number.
It is an amenable number.
34220616301 is a deficient number, since it is larger than the sum of its proper divisors (1).
34220616301 is an equidigital number, since it uses as much as digits as its factorization.
34220616301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
The spelling of 34220616301 in words is "thirty-four billion, two hundred twenty million, six hundred sixteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •