Base | Representation |
---|---|
bin | 1001100100000101010110… |
… | …00101110010000111010001 |
3 | 2202110112202122212112222021 |
4 | 10302002223011302013101 |
5 | 10224033022224114022 |
6 | 112421304423411441 |
7 | 4300304352002113 |
oct | 462025305620721 |
9 | 82415678775867 |
10 | 21031030301137 |
11 | 67792343664aa |
12 | 2437b555b3b81 |
13 | b972aa2308bc |
14 | 529c9b8a73b3 |
15 | 2670ea8e07c7 |
hex | 1320ab1721d1 |
21031030301137 has 2 divisors, whose sum is σ = 21031030301138. Its totient is φ = 21031030301136.
The previous prime is 21031030301131. The next prime is 21031030301201. The reversal of 21031030301137 is 73110303013012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15323537291841 + 5707493009296 = 3914529^2 + 2389036^2 .
It is a cyclic number.
It is not a de Polignac number, because 21031030301137 - 23 = 21031030301129 is a prime.
It is not a weakly prime, because it can be changed into another prime (21031030301131) 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, 10515515150568 + 10515515150569.
It is an arithmetic number, because the mean of its divisors is an integer number (10515515150569).
Almost surely, 221031030301137 is an apocalyptic number.
It is an amenable number.
21031030301137 is a deficient number, since it is larger than the sum of its proper divisors (1).
21031030301137 is an equidigital number, since it uses as much as digits as its factorization.
21031030301137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 21031030301137 its reverse (73110303013012), we get a palindrome (94141333314149).
The spelling of 21031030301137 in words is "twenty-one trillion, thirty-one billion, thirty million, three hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •