Base | Representation |
---|---|
bin | 1011101110010110100… |
… | …1000001111101011101 |
3 | 201020220101120212001012 |
4 | 2323211221001331131 |
5 | 11300002313442023 |
6 | 232310500025005 |
7 | 20360256145256 |
oct | 2734551017535 |
9 | 636811525035 |
10 | 201421234013 |
11 | 7847104336a |
12 | 33053692165 |
13 | 15cbc8c394c |
14 | 9a6ab5db2d |
15 | 538d110978 |
hex | 2ee5a41f5d |
201421234013 has 2 divisors, whose sum is σ = 201421234014. Its totient is φ = 201421234012.
The previous prime is 201421233989. The next prime is 201421234033. The reversal of 201421234013 is 310432124102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 198235986169 + 3185247844 = 445237^2 + 56438^2 .
It is a cyclic number.
It is not a de Polignac number, because 201421234013 - 214 = 201421217629 is a prime.
It is a super-2 number, since 2×2014212340132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201421234013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201421234033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100710617006 + 100710617007.
It is an arithmetic number, because the mean of its divisors is an integer number (100710617007).
Almost surely, 2201421234013 is an apocalyptic number.
It is an amenable number.
201421234013 is a deficient number, since it is larger than the sum of its proper divisors (1).
201421234013 is an equidigital number, since it uses as much as digits as its factorization.
201421234013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 201421234013 its reverse (310432124102), we get a palindrome (511853358115).
The spelling of 201421234013 in words is "two hundred one billion, four hundred twenty-one million, two hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •