Base | Representation |
---|---|
bin | 10111011100001000111110… |
… | …111011010000111000111101 |
3 | 111112000012100221210012122121 |
4 | 113130020332323100320331 |
5 | 102003001441323333121 |
6 | 1003130211400442541 |
7 | 30466632033333325 |
oct | 2734107673207075 |
9 | 445005327705577 |
10 | 103088860761661 |
11 | 2a935816419355 |
12 | b68b38aa79451 |
13 | 456a312759498 |
14 | 1b657555b2285 |
15 | bdb8a0358141 |
hex | 5dc23eed0e3d |
103088860761661 has 2 divisors, whose sum is σ = 103088860761662. Its totient is φ = 103088860761660.
The previous prime is 103088860761577. The next prime is 103088860761701. The reversal of 103088860761661 is 166167068880301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103026438237636 + 62422524025 = 10150194^2 + 249845^2 .
It is a cyclic number.
It is not a de Polignac number, because 103088860761661 - 27 = 103088860761533 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103088860761661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103088860761361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51544430380830 + 51544430380831.
It is an arithmetic number, because the mean of its divisors is an integer number (51544430380831).
Almost surely, 2103088860761661 is an apocalyptic number.
It is an amenable number.
103088860761661 is a deficient number, since it is larger than the sum of its proper divisors (1).
103088860761661 is an equidigital number, since it uses as much as digits as its factorization.
103088860761661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13934592, while the sum is 61.
The spelling of 103088860761661 in words is "one hundred three trillion, eighty-eight billion, eight hundred sixty million, seven hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •