Base | Representation |
---|---|
bin | 1001100010011111100111… |
… | …1001011101111101101101 |
3 | 1101010122220020021011120222 |
4 | 2120213321321131331231 |
5 | 2333314322141330021 |
6 | 34150114403421125 |
7 | 2131514365011116 |
oct | 230477171357555 |
9 | 41118806234528 |
10 | 10488207761261 |
11 | 3384029943a6a |
12 | 12148276847a5 |
13 | 5b10591b5629 |
14 | 2838bc17720d |
15 | 132c506946ab |
hex | 989f9e5df6d |
10488207761261 has 4 divisors (see below), whose sum is σ = 10510860478272. Its totient is φ = 10465555044252.
The previous prime is 10488207761237. The next prime is 10488207761279. The reversal of 10488207761261 is 16216770288401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10488207761261 is a prime.
It is a super-2 number, since 2×104882077612612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10488207761201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11326357811 + ... + 11326358736.
It is an arithmetic number, because the mean of its divisors is an integer number (2627715119568).
Almost surely, 210488207761261 is an apocalyptic number.
It is an amenable number.
10488207761261 is a deficient number, since it is larger than the sum of its proper divisors (22652717011).
10488207761261 is an equidigital number, since it uses as much as digits as its factorization.
10488207761261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22652717010.
The product of its (nonzero) digits is 1806336, while the sum is 53.
The spelling of 10488207761261 in words is "ten trillion, four hundred eighty-eight billion, two hundred seven million, seven hundred sixty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •