Base | Representation |
---|---|
bin | 100101000100011011011001… |
… | …000111011100110001110111 |
3 | 210101020201010011202022102021 |
4 | 211010123121013130301313 |
5 | 132332104024333332302 |
6 | 1334423512204254011 |
7 | 46224450135411151 |
oct | 4504333107346167 |
9 | 711221104668367 |
10 | 163032011230327 |
11 | 47a46540116108 |
12 | 16350842841307 |
13 | 6cc7b11496325 |
14 | 2c38b11a29ad1 |
15 | 13cac84070437 |
hex | 9446d91dcc77 |
163032011230327 has 2 divisors, whose sum is σ = 163032011230328. Its totient is φ = 163032011230326.
The previous prime is 163032011230301. The next prime is 163032011230337. The reversal of 163032011230327 is 723032110230361.
It is a strong prime.
It is an emirp because it is prime and its reverse (723032110230361) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 163032011230327 - 247 = 22294522874999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 163032011230292 and 163032011230301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (163032011230337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81516005615163 + 81516005615164.
It is an arithmetic number, because the mean of its divisors is an integer number (81516005615164).
Almost surely, 2163032011230327 is an apocalyptic number.
163032011230327 is a deficient number, since it is larger than the sum of its proper divisors (1).
163032011230327 is an equidigital number, since it uses as much as digits as its factorization.
163032011230327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 34.
Adding to 163032011230327 its reverse (723032110230361), we get a palindrome (886064121460688).
The spelling of 163032011230327 in words is "one hundred sixty-three trillion, thirty-two billion, eleven million, two hundred thirty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •