Base | Representation |
---|---|
bin | 101011111010000110000… |
… | …1111001101010110111101 |
3 | 210100220110001012120000101 |
4 | 1113310030033031112331 |
5 | 1242332412344124344 |
6 | 20500134525401101 |
7 | 1161662602516303 |
oct | 127641417152675 |
9 | 23326401176011 |
10 | 6034634364349 |
11 | 1a17301859a68 |
12 | 815676a09191 |
13 | 34a0a98b4806 |
14 | 16c11391c273 |
15 | a6e948919d4 |
hex | 57d0c3cd5bd |
6034634364349 has 2 divisors, whose sum is σ = 6034634364350. Its totient is φ = 6034634364348.
The previous prime is 6034634364299. The next prime is 6034634364371. The reversal of 6034634364349 is 9434634364306.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4730429252025 + 1304205112324 = 2174955^2 + 1142018^2 .
It is a cyclic number.
It is not a de Polignac number, because 6034634364349 - 29 = 6034634363837 is a prime.
It is a super-2 number, since 2×60346343643492 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6034634364349.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6034634365349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3017317182174 + 3017317182175.
It is an arithmetic number, because the mean of its divisors is an integer number (3017317182175).
Almost surely, 26034634364349 is an apocalyptic number.
It is an amenable number.
6034634364349 is a deficient number, since it is larger than the sum of its proper divisors (1).
6034634364349 is an equidigital number, since it uses as much as digits as its factorization.
6034634364349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40310784, while the sum is 55.
The spelling of 6034634364349 in words is "six trillion, thirty-four billion, six hundred thirty-four million, three hundred sixty-four thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •