Base | Representation |
---|---|
bin | 10111010001011101111011… |
… | …010111101011000001011001 |
3 | 111102102002021021122020102211 |
4 | 113101131323113223001121 |
5 | 101403442412432342243 |
6 | 1001405234330355121 |
7 | 30362636052035203 |
oct | 2721357327530131 |
9 | 442362237566384 |
10 | 102355435434073 |
11 | 2a6827729a1388 |
12 | b59120428baa1 |
13 | 45160cb3a42c3 |
14 | 1b3c05ad81773 |
15 | bc7776ab9d9d |
hex | 5d177b5eb059 |
102355435434073 has 2 divisors, whose sum is σ = 102355435434074. Its totient is φ = 102355435434072.
The previous prime is 102355435434071. The next prime is 102355435434151. The reversal of 102355435434073 is 370434534553201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 75439178338329 + 26916257095744 = 8685573^2 + 5188088^2 .
It is a cyclic number.
It is not a de Polignac number, because 102355435434073 - 21 = 102355435434071 is a prime.
Together with 102355435434071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102355435434071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51177717717036 + 51177717717037.
It is an arithmetic number, because the mean of its divisors is an integer number (51177717717037).
Almost surely, 2102355435434073 is an apocalyptic number.
It is an amenable number.
102355435434073 is a deficient number, since it is larger than the sum of its proper divisors (1).
102355435434073 is an equidigital number, since it uses as much as digits as its factorization.
102355435434073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072000, while the sum is 49.
Adding to 102355435434073 its reverse (370434534553201), we get a palindrome (472789969987274).
The spelling of 102355435434073 in words is "one hundred two trillion, three hundred fifty-five billion, four hundred thirty-five million, four hundred thirty-four thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •