Base | Representation |
---|---|
bin | 1000100000000001010… |
… | …0011000111100110101 |
3 | 111221221101011200110112 |
4 | 2020000110120330311 |
5 | 4343034230430031 |
6 | 151030500232405 |
7 | 13356602333516 |
oct | 2100024307465 |
9 | 457841150415 |
10 | 146034233141 |
11 | 56a29576885 |
12 | 2437669b705 |
13 | 10a03a85754 |
14 | 70d4bcca0d |
15 | 3bea86c62b |
hex | 2200518f35 |
146034233141 has 2 divisors, whose sum is σ = 146034233142. Its totient is φ = 146034233140.
The previous prime is 146034233089. The next prime is 146034233143. The reversal of 146034233141 is 141332430641.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104536469041 + 41497764100 = 323321^2 + 203710^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146034233141 is a prime.
Together with 146034233143, 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 = 146034233098 and 146034233107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (146034233143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 73017116570 + 73017116571.
It is an arithmetic number, because the mean of its divisors is an integer number (73017116571).
Almost surely, 2146034233141 is an apocalyptic number.
It is an amenable number.
146034233141 is a deficient number, since it is larger than the sum of its proper divisors (1).
146034233141 is an equidigital number, since it uses as much as digits as its factorization.
146034233141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 146034233141 its reverse (141332430641), we get a palindrome (287366663782).
The spelling of 146034233141 in words is "one hundred forty-six billion, thirty-four million, two hundred thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •