Base | Representation |
---|---|
bin | 1001001100001111110011… |
… | …0011111101111011111101 |
3 | 1022210010100211111221011201 |
4 | 2103003330303331323331 |
5 | 2311034044131433121 |
6 | 33254345010415501 |
7 | 2062064133300421 |
oct | 223037463757375 |
9 | 38703324457151 |
10 | 10106004561661 |
11 | 3246a29126178 |
12 | 1172740591591 |
13 | 583cb8970118 |
14 | 26d1c1828b81 |
15 | 127d313b6e91 |
hex | 930fccfdefd |
10106004561661 has 2 divisors, whose sum is σ = 10106004561662. Its totient is φ = 10106004561660.
The previous prime is 10106004561649. The next prime is 10106004561677. The reversal of 10106004561661 is 16616540060101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8645399373636 + 1460605188025 = 2940306^2 + 1208555^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10106004561661 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10106004561661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10106004567661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5053002280830 + 5053002280831.
It is an arithmetic number, because the mean of its divisors is an integer number (5053002280831).
Almost surely, 210106004561661 is an apocalyptic number.
It is an amenable number.
10106004561661 is a deficient number, since it is larger than the sum of its proper divisors (1).
10106004561661 is an equidigital number, since it uses as much as digits as its factorization.
10106004561661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 10106004561661 in words is "ten trillion, one hundred six billion, four million, five hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •