Base | Representation |
---|---|
bin | 11111110011000110… |
… | …000000101000111001 |
3 | 10021010111110210001212 |
4 | 133303012000220321 |
5 | 1024411130210131 |
6 | 23403555252505 |
7 | 2316046332263 |
oct | 376306005071 |
9 | 107114423055 |
10 | 34143210041 |
11 | 13530a52066 |
12 | 674a5aa135 |
13 | 32b1878c85 |
14 | 191c7dab33 |
15 | d4c73ba2b |
hex | 7f3180a39 |
34143210041 has 2 divisors, whose sum is σ = 34143210042. Its totient is φ = 34143210040.
The previous prime is 34143210029. The next prime is 34143210043. The reversal of 34143210041 is 14001234143.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24222253225 + 9920956816 = 155635^2 + 99604^2 .
It is a cyclic number.
It is not a de Polignac number, because 34143210041 - 230 = 33069468217 is a prime.
Together with 34143210043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 34143209989 and 34143210016.
It is not a weakly prime, because it can be changed into another prime (34143210043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17071605020 + 17071605021.
It is an arithmetic number, because the mean of its divisors is an integer number (17071605021).
Almost surely, 234143210041 is an apocalyptic number.
It is an amenable number.
34143210041 is a deficient number, since it is larger than the sum of its proper divisors (1).
34143210041 is an equidigital number, since it uses as much as digits as its factorization.
34143210041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 34143210041 its reverse (14001234143), we get a palindrome (48144444184).
The spelling of 34143210041 in words is "thirty-four billion, one hundred forty-three million, two hundred ten thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •