Base | Representation |
---|---|
bin | 1001010100011101100… |
… | …11011110000101010001 |
3 | 1010121112220220002010101 |
4 | 10222032303132011101 |
5 | 20221304144442022 |
6 | 403035243332401 |
7 | 32064302206432 |
oct | 4521663360521 |
9 | 1117486802111 |
10 | 320223437137 |
11 | 113895866a0a |
12 | 5208a221101 |
13 | 242738a8566 |
14 | 116dad8b489 |
15 | 84e2d63627 |
hex | 4a8ecde151 |
320223437137 has 2 divisors, whose sum is σ = 320223437138. Its totient is φ = 320223437136.
The previous prime is 320223437117. The next prime is 320223437143. The reversal of 320223437137 is 731734322023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 317519853121 + 2703584016 = 563489^2 + 51996^2 .
It is an emirp because it is prime and its reverse (731734322023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 320223437137 - 211 = 320223435089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320223437096 and 320223437105.
It is not a weakly prime, because it can be changed into another prime (320223437117) 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, 160111718568 + 160111718569.
It is an arithmetic number, because the mean of its divisors is an integer number (160111718569).
Almost surely, 2320223437137 is an apocalyptic number.
It is an amenable number.
320223437137 is a deficient number, since it is larger than the sum of its proper divisors (1).
320223437137 is an equidigital number, since it uses as much as digits as its factorization.
320223437137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 127008, while the sum is 37.
The spelling of 320223437137 in words is "three hundred twenty billion, two hundred twenty-three million, four hundred thirty-seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •