Base | Representation |
---|---|
bin | 1100010000101111000… |
… | …00001100100110101101 |
3 | 1111021110012100221021202 |
4 | 12020113200030212231 |
5 | 23400311041024323 |
6 | 521313144535245 |
7 | 42303143234033 |
oct | 6102740144655 |
9 | 1437405327252 |
10 | 421301111213 |
11 | 152744548544 |
12 | 69798a81525 |
13 | 3096174c968 |
14 | 165691b8553 |
15 | ae5b9c3d28 |
hex | 621780c9ad |
421301111213 has 2 divisors, whose sum is σ = 421301111214. Its totient is φ = 421301111212.
The previous prime is 421301111197. The next prime is 421301111251. The reversal of 421301111213 is 312111103124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 420231952009 + 1069159204 = 648253^2 + 32698^2 .
It is a cyclic number.
It is not a de Polignac number, because 421301111213 - 24 = 421301111197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (421301311213) 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, 210650555606 + 210650555607.
It is an arithmetic number, because the mean of its divisors is an integer number (210650555607).
Almost surely, 2421301111213 is an apocalyptic number.
It is an amenable number.
421301111213 is a deficient number, since it is larger than the sum of its proper divisors (1).
421301111213 is an equidigital number, since it uses as much as digits as its factorization.
421301111213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 421301111213 its reverse (312111103124), we get a palindrome (733412214337).
It can be divided in two parts, 4213011 and 11213, that added together give a palindrome (4224224).
The spelling of 421301111213 in words is "four hundred twenty-one billion, three hundred one million, one hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •