Base | Representation |
---|---|
bin | 11111110111010000… |
… | …001111100100000101 |
3 | 10021022100210112220212 |
4 | 133313100033210011 |
5 | 1030032012021402 |
6 | 23414531205205 |
7 | 2320554466664 |
oct | 376720174405 |
9 | 107270715825 |
10 | 34213001477 |
11 | 13567390436 |
12 | 6769a46805 |
13 | 32c3173895 |
14 | 1927ba6ddb |
15 | d53925952 |
hex | 7f740f905 |
34213001477 has 2 divisors, whose sum is σ = 34213001478. Its totient is φ = 34213001476.
The previous prime is 34213001411. The next prime is 34213001509. The reversal of 34213001477 is 77410031243.
It is an a-pointer prime, because the next prime (34213001509) can be obtained adding 34213001477 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34057226116 + 155775361 = 184546^2 + 12481^2 .
It is an emirp because it is prime and its reverse (77410031243) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34213001477 - 210 = 34213000453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34213000477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17106500738 + 17106500739.
It is an arithmetic number, because the mean of its divisors is an integer number (17106500739).
Almost surely, 234213001477 is an apocalyptic number.
It is an amenable number.
34213001477 is a deficient number, since it is larger than the sum of its proper divisors (1).
34213001477 is an equidigital number, since it uses as much as digits as its factorization.
34213001477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 32.
The spelling of 34213001477 in words is "thirty-four billion, two hundred thirteen million, one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •