Base | Representation |
---|---|
bin | 10010101001100011… |
… | …00101111001110001 |
3 | 221211202202112020112 |
4 | 21110301211321301 |
5 | 131001112033131 |
6 | 4333300351105 |
7 | 503053321544 |
oct | 112461457161 |
9 | 27752675215 |
10 | 10012221041 |
11 | 4278701949 |
12 | 1b350a5495 |
13 | c373a8c64 |
14 | 6ada2485b |
15 | 3d8ec402b |
hex | 254c65e71 |
10012221041 has 2 divisors, whose sum is σ = 10012221042. Its totient is φ = 10012221040.
The previous prime is 10012221017. The next prime is 10012221071. The reversal of 10012221041 is 14012221001.
It is a happy number.
10012221041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8194051441 + 1818169600 = 90521^2 + 42640^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10012221041 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10012221071) 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, 5006110520 + 5006110521.
It is an arithmetic number, because the mean of its divisors is an integer number (5006110521).
Almost surely, 210012221041 is an apocalyptic number.
It is an amenable number.
10012221041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012221041 is an equidigital number, since it uses as much as digits as its factorization.
10012221041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10012221041 its reverse (14012221001), we get a palindrome (24024442042).
The spelling of 10012221041 in words is "ten billion, twelve million, two hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •