Base | Representation |
---|---|
bin | 111100001101010… |
… | …000110111110101 |
3 | 2121101200220100022 |
4 | 330031100313311 |
5 | 4032042004231 |
6 | 244122054525 |
7 | 34013535641 |
oct | 7415206765 |
9 | 2541626308 |
10 | 1010109941 |
11 | 4791a9605 |
12 | 24234a445 |
13 | 131369ab9 |
14 | 9821dc21 |
15 | 5da2bc7b |
hex | 3c350df5 |
1010109941 has 2 divisors, whose sum is σ = 1010109942. Its totient is φ = 1010109940.
The previous prime is 1010109923. The next prime is 1010109949. The reversal of 1010109941 is 1499010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 951969316 + 58140625 = 30854^2 + 7625^2 .
It is an emirp because it is prime and its reverse (1499010101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010109941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010109941.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010109949) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505054970 + 505054971.
It is an arithmetic number, because the mean of its divisors is an integer number (505054971).
Almost surely, 21010109941 is an apocalyptic number.
It is an amenable number.
1010109941 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010109941 is an equidigital number, since it uses as much as digits as its factorization.
1010109941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 26.
The square root of 1010109941 is about 31782.2268099641. The cubic root of 1010109941 is about 1003.3586869259.
The spelling of 1010109941 in words is "one billion, ten million, one hundred nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •