Base | Representation |
---|---|
bin | 1001000111010101100010… |
… | …0011100111111100101001 |
3 | 1022111001121122001111011001 |
4 | 2101311120203213330221 |
5 | 2303143311433411431 |
6 | 33151514020235001 |
7 | 2053016456121115 |
oct | 221653043477451 |
9 | 38431548044131 |
10 | 10021644435241 |
11 | 321417902462a |
12 | 115a31853ba61 |
13 | 57906342645a |
14 | 26909b994745 |
15 | 125a45238e61 |
hex | 91d588e7f29 |
10021644435241 has 2 divisors, whose sum is σ = 10021644435242. Its totient is φ = 10021644435240.
The previous prime is 10021644435211. The next prime is 10021644435293. The reversal of 10021644435241 is 14253444612001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9025698318400 + 995946116841 = 3004280^2 + 997971^2 .
It is a cyclic number.
It is not a de Polignac number, because 10021644435241 - 217 = 10021644304169 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10021644435241.
It is not a weakly prime, because it can be changed into another prime (10021644435211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5010822217620 + 5010822217621.
It is an arithmetic number, because the mean of its divisors is an integer number (5010822217621).
Almost surely, 210021644435241 is an apocalyptic number.
It is an amenable number.
10021644435241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10021644435241 is an equidigital number, since it uses as much as digits as its factorization.
10021644435241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 92160, while the sum is 37.
The spelling of 10021644435241 in words is "ten trillion, twenty-one billion, six hundred forty-four million, four hundred thirty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •