Base | Representation |
---|---|
bin | 1001101100110110001101… |
… | …11000010011011011111001 |
3 | 2210112022222210212120002021 |
4 | 10312123012320103123321 |
5 | 10244001212411143002 |
6 | 113211503552234441 |
7 | 4331124264154645 |
oct | 466330670233371 |
9 | 83468883776067 |
10 | 21332144240377 |
11 | 6884a03328843 |
12 | 248638bb3ba21 |
13 | bb97c6a80a49 |
14 | 53a6a4935c25 |
15 | 26ed70c8a737 |
hex | 1366c6e136f9 |
21332144240377 has 2 divisors, whose sum is σ = 21332144240378. Its totient is φ = 21332144240376.
The previous prime is 21332144240371. The next prime is 21332144240401. The reversal of 21332144240377 is 77304244123312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21332103331561 + 40908816 = 4618669^2 + 6396^2 .
It is a cyclic number.
It is not a de Polignac number, because 21332144240377 - 219 = 21332143716089 is a prime.
It is a super-2 number, since 2×213321442403772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21332144240371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10666072120188 + 10666072120189.
It is an arithmetic number, because the mean of its divisors is an integer number (10666072120189).
Almost surely, 221332144240377 is an apocalyptic number.
It is an amenable number.
21332144240377 is a deficient number, since it is larger than the sum of its proper divisors (1).
21332144240377 is an equidigital number, since it uses as much as digits as its factorization.
21332144240377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 677376, while the sum is 43.
Adding to 21332144240377 its reverse (77304244123312), we get a palindrome (98636388363689).
The spelling of 21332144240377 in words is "twenty-one trillion, three hundred thirty-two billion, one hundred forty-four million, two hundred forty thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •