Base | Representation |
---|---|
bin | 101110110011110001… |
… | …1101101001000100001 |
3 | 100121110112020110120001 |
4 | 1131213203231020201 |
5 | 3121332021122321 |
6 | 114102400020001 |
7 | 10156010006641 |
oct | 1354743551041 |
9 | 317415213501 |
10 | 100521660961 |
11 | 396a3947767 |
12 | 17594601601 |
13 | 962c909c77 |
14 | 4c18454521 |
15 | 2934e30c91 |
hex | 17678ed221 |
100521660961 has 2 divisors, whose sum is σ = 100521660962. Its totient is φ = 100521660960.
The previous prime is 100521660947. The next prime is 100521660983. The reversal of 100521660961 is 169066125001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86888763361 + 13632897600 = 294769^2 + 116760^2 .
It is a cyclic number.
It is not a de Polignac number, because 100521660961 - 25 = 100521660929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100521660961.
It is not a weakly prime, because it can be changed into another prime (100521669961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50260830480 + 50260830481.
It is an arithmetic number, because the mean of its divisors is an integer number (50260830481).
Almost surely, 2100521660961 is an apocalyptic number.
It is an amenable number.
100521660961 is a deficient number, since it is larger than the sum of its proper divisors (1).
100521660961 is an equidigital number, since it uses as much as digits as its factorization.
100521660961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 37.
Adding to 100521660961 its reverse (169066125001), we get a palindrome (269587785962).
The spelling of 100521660961 in words is "one hundred billion, five hundred twenty-one million, six hundred sixty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •