Base | Representation |
---|---|
bin | 1001100010110000011… |
… | …0100100110111110011 |
3 | 120200011212100210210002 |
4 | 2120230012210313303 |
5 | 10141231330204033 |
6 | 203152245100215 |
7 | 14562541526561 |
oct | 2305406446763 |
9 | 520155323702 |
10 | 163948678643 |
11 | 63591833942 |
12 | 279360b766b |
13 | 125ca35c669 |
14 | 7d14108a31 |
15 | 43e84763e8 |
hex | 262c1a4df3 |
163948678643 has 12 divisors (see below), whose sum is σ = 169644278880. Its totient is φ = 158438676240.
The previous prime is 163948678627. The next prime is 163948678651. The reversal of 163948678643 is 346876849361.
163948678643 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 163948678643 - 24 = 163948678627 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 163948678643.
It is not an unprimeable number, because it can be changed into a prime (163948678603) 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 in 11 ways as a sum of consecutive naturals, for example, 572321 + ... + 809597.
It is an arithmetic number, because the mean of its divisors is an integer number (14137023240).
Almost surely, 2163948678643 is an apocalyptic number.
163948678643 is a deficient number, since it is larger than the sum of its proper divisors (5695600237).
163948678643 is an equidigital number, since it uses as much as digits as its factorization.
163948678643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238058 (or 238027 counting only the distinct ones).
The product of its digits is 125411328, while the sum is 65.
The spelling of 163948678643 in words is "one hundred sixty-three billion, nine hundred forty-eight million, six hundred seventy-eight thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •