Base | Representation |
---|---|
bin | 100100011100010110000111… |
… | …0101011000101100111001011 |
3 | 1120000222202211012000212222212 |
4 | 1020320230032223011213023 |
5 | 314003433401330010123 |
6 | 3053432554403335335 |
7 | 124343225646355334 |
oct | 11070541653054713 |
9 | 1500882735025885 |
10 | 320555130313163 |
11 | 93158738230239 |
12 | 2bb5189468154b |
13 | 109b32b04300a5 |
14 | 5922d45b0b28b |
15 | 270d5942b5878 |
hex | 1238b0eac59cb |
320555130313163 has 2 divisors, whose sum is σ = 320555130313164. Its totient is φ = 320555130313162.
The previous prime is 320555130313133. The next prime is 320555130313237. The reversal of 320555130313163 is 361313031555023.
It is a weak prime.
It is an emirp because it is prime and its reverse (361313031555023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 320555130313163 - 210 = 320555130312139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 320555130313163.
It is not a weakly prime, because it can be changed into another prime (320555130313133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160277565156581 + 160277565156582.
It is an arithmetic number, because the mean of its divisors is an integer number (160277565156582).
Almost surely, 2320555130313163 is an apocalyptic number.
320555130313163 is a deficient number, since it is larger than the sum of its proper divisors (1).
320555130313163 is an equidigital number, since it uses as much as digits as its factorization.
320555130313163 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 364500, while the sum is 41.
Adding to 320555130313163 its reverse (361313031555023), we get a palindrome (681868161868186).
The spelling of 320555130313163 in words is "three hundred twenty trillion, five hundred fifty-five billion, one hundred thirty million, three hundred thirteen thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •