Base | Representation |
---|---|
bin | 1111100001101011001011… |
… | …10000101111100001010001 |
3 | 11110212222111201110110002002 |
4 | 13300311211300233201101 |
5 | 13433342114442443043 |
6 | 200340445245003345 |
7 | 10122464362155443 |
oct | 760654560574121 |
9 | 143788451413062 |
10 | 34142402312273 |
11 | a973791018602 |
12 | 39b5039553555 |
13 | 16087cb714c08 |
14 | 860702dba493 |
15 | 3e31c7836bb8 |
hex | 1f0d65c2f851 |
34142402312273 has 2 divisors, whose sum is σ = 34142402312274. Its totient is φ = 34142402312272.
The previous prime is 34142402312267. The next prime is 34142402312309. The reversal of 34142402312273 is 37221320424143.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25192689869824 + 8949712442449 = 5019232^2 + 2991607^2 .
It is an emirp because it is prime and its reverse (37221320424143) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 34142402312273 - 26 = 34142402312209 is a prime.
It is not a weakly prime, because it can be changed into another prime (34142402312233) 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, 17071201156136 + 17071201156137.
It is an arithmetic number, because the mean of its divisors is an integer number (17071201156137).
Almost surely, 234142402312273 is an apocalyptic number.
It is an amenable number.
34142402312273 is a deficient number, since it is larger than the sum of its proper divisors (1).
34142402312273 is an equidigital number, since it uses as much as digits as its factorization.
34142402312273 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 38.
The spelling of 34142402312273 in words is "thirty-four trillion, one hundred forty-two billion, four hundred two million, three hundred twelve thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •