Base | Representation |
---|---|
bin | 1001101001011010001101… |
… | …00001000100101100010101 |
3 | 2210010001002222121012000102 |
4 | 10310231012201010230111 |
5 | 10240032311244100122 |
6 | 113041331140223445 |
7 | 4316443232312546 |
oct | 464550641045425 |
9 | 83101088535012 |
10 | 21214026550037 |
11 | 68398aaa36842 |
12 | 246750669ab85 |
13 | bab621845199 |
14 | 534a9b5b04cd |
15 | 26bc5b19b492 |
hex | 134b46844b15 |
21214026550037 has 2 divisors, whose sum is σ = 21214026550038. Its totient is φ = 21214026550036.
The previous prime is 21214026550033. The next prime is 21214026550063. The reversal of 21214026550037 is 73005562041212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11156762350276 + 10057264199761 = 3340174^2 + 3171319^2 .
It is a cyclic number.
It is not a de Polignac number, because 21214026550037 - 22 = 21214026550033 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21214026550033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10607013275018 + 10607013275019.
It is an arithmetic number, because the mean of its divisors is an integer number (10607013275019).
Almost surely, 221214026550037 is an apocalyptic number.
It is an amenable number.
21214026550037 is a deficient number, since it is larger than the sum of its proper divisors (1).
21214026550037 is an equidigital number, since it uses as much as digits as its factorization.
21214026550037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 38.
Adding to 21214026550037 its reverse (73005562041212), we get a palindrome (94219588591249).
The spelling of 21214026550037 in words is "twenty-one trillion, two hundred fourteen billion, twenty-six million, five hundred fifty thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •