Base | Representation |
---|---|
bin | 1001001110111000111111… |
… | …1000011010100100010101 |
3 | 1022221110121000210010112212 |
4 | 2103232033320122210111 |
5 | 2312310102420314341 |
6 | 33331255420323205 |
7 | 2065262456215304 |
oct | 223561770324425 |
9 | 38843530703485 |
10 | 10151421651221 |
11 | 3264214969834 |
12 | 117b4b66a3505 |
13 | 5883760c7306 |
14 | 27148d62a43b |
15 | 1290dd7425eb |
hex | 93b8fe1a915 |
10151421651221 has 2 divisors, whose sum is σ = 10151421651222. Its totient is φ = 10151421651220.
The previous prime is 10151421651199. The next prime is 10151421651289. The reversal of 10151421651221 is 12215612415101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7458967294321 + 2692454356900 = 2731111^2 + 1640870^2 .
It is an emirp because it is prime and its reverse (12215612415101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10151421651221 - 210 = 10151421650197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10151421651821) 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, 5075710825610 + 5075710825611.
It is an arithmetic number, because the mean of its divisors is an integer number (5075710825611).
Almost surely, 210151421651221 is an apocalyptic number.
It is an amenable number.
10151421651221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10151421651221 is an equidigital number, since it uses as much as digits as its factorization.
10151421651221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 32.
The spelling of 10151421651221 in words is "ten trillion, one hundred fifty-one billion, four hundred twenty-one million, six hundred fifty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •