Base | Representation |
---|---|
bin | 11111111101010101… |
… | …110100101110111101 |
3 | 10021120110222002211002 |
4 | 133331111310232331 |
5 | 1030234133041431 |
6 | 23433020140045 |
7 | 2323234526126 |
oct | 377525645675 |
9 | 107513862732 |
10 | 34315127741 |
11 | 13609aa4404 |
12 | 6798097625 |
13 | 330b38011b |
14 | 193758d04d |
15 | d5c89a3cb |
hex | 7fd574bbd |
34315127741 has 2 divisors, whose sum is σ = 34315127742. Its totient is φ = 34315127740.
The previous prime is 34315127729. The next prime is 34315127753. The reversal of 34315127741 is 14772151343.
It is a balanced prime because it is at equal distance from previous prime (34315127729) and next prime (34315127753).
It can be written as a sum of positive squares in only one way, i.e., 24204825241 + 10110302500 = 155579^2 + 100550^2 .
It is a cyclic number.
It is not a de Polignac number, because 34315127741 - 230 = 33241385917 is a prime.
It is a super-2 number, since 2×343151277412 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 34315127695 and 34315127704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34315127711) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17157563870 + 17157563871.
It is an arithmetic number, because the mean of its divisors is an integer number (17157563871).
Almost surely, 234315127741 is an apocalyptic number.
It is an amenable number.
34315127741 is a deficient number, since it is larger than the sum of its proper divisors (1).
34315127741 is an equidigital number, since it uses as much as digits as its factorization.
34315127741 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 70560, while the sum is 38.
The spelling of 34315127741 in words is "thirty-four billion, three hundred fifteen million, one hundred twenty-seven thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •