Base | Representation |
---|---|
bin | 10111101100010110001001… |
… | …000100110101001111110011 |
3 | 111122221122212110221210210212 |
4 | 113230112021010311033303 |
5 | 102124223210314013043 |
6 | 1005341545050414335 |
7 | 30643245060001544 |
oct | 2754261104651763 |
9 | 448848773853725 |
10 | 104202501313523 |
11 | 3022503a48a8a8 |
12 | b82b186a313ab |
13 | 461b33b52cb02 |
14 | 1ba35dc5064cb |
15 | c0a82d5d9018 |
hex | 5ec5891353f3 |
104202501313523 has 2 divisors, whose sum is σ = 104202501313524. Its totient is φ = 104202501313522.
The previous prime is 104202501313433. The next prime is 104202501313567. The reversal of 104202501313523 is 325313105202401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104202501313523 - 212 = 104202501309427 is a prime.
It is a super-2 number, since 2×1042025013135232 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104202501313523.
It is not a weakly prime, because it can be changed into another prime (104202501313723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52101250656761 + 52101250656762.
It is an arithmetic number, because the mean of its divisors is an integer number (52101250656762).
Almost surely, 2104202501313523 is an apocalyptic number.
104202501313523 is a deficient number, since it is larger than the sum of its proper divisors (1).
104202501313523 is an equidigital number, since it uses as much as digits as its factorization.
104202501313523 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 104202501313523 its reverse (325313105202401), we get a palindrome (429515606515924).
The spelling of 104202501313523 in words is "one hundred four trillion, two hundred two billion, five hundred one million, three hundred thirteen thousand, five hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •