Base | Representation |
---|---|
bin | 1001010001110011001110… |
… | …1011110010011001001101 |
3 | 1100010020122010001011120121 |
4 | 2110130303223302121031 |
5 | 2314114444044211441 |
6 | 33410244243344541 |
7 | 2102012363024461 |
oct | 224346353623115 |
9 | 40106563034517 |
10 | 10201414444621 |
11 | 328343955a414 |
12 | 1189129082151 |
13 | 58ccb2512a7a |
14 | 273a730024a1 |
15 | 12a567661dd1 |
hex | 94733af264d |
10201414444621 has 2 divisors, whose sum is σ = 10201414444622. Its totient is φ = 10201414444620.
The previous prime is 10201414444609. The next prime is 10201414444709. The reversal of 10201414444621 is 12644441410201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7815038300521 + 2386376144100 = 2795539^2 + 1544790^2 .
It is a cyclic number.
It is not a de Polignac number, because 10201414444621 - 27 = 10201414444493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201414447621) 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, 5100707222310 + 5100707222311.
It is an arithmetic number, because the mean of its divisors is an integer number (5100707222311).
Almost surely, 210201414444621 is an apocalyptic number.
It is an amenable number.
10201414444621 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201414444621 is an equidigital number, since it uses as much as digits as its factorization.
10201414444621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 34.
Adding to 10201414444621 its reverse (12644441410201), we get a palindrome (22845855854822).
The spelling of 10201414444621 in words is "ten trillion, two hundred one billion, four hundred fourteen million, four hundred forty-four thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •