Base | Representation |
---|---|
bin | 1001010111001011110… |
… | …1010001001010001011 |
3 | 120101011101110020010201 |
4 | 2111302331101022023 |
5 | 10113401132004033 |
6 | 201520123553031 |
7 | 14422553204164 |
oct | 2256275211213 |
9 | 511141406121 |
10 | 160842453643 |
11 | 62238410043 |
12 | 2720998b777 |
13 | 122239650c1 |
14 | 7adb77076b |
15 | 42b58ed47d |
hex | 2572f5128b |
160842453643 has 6 divisors (see below), whose sum is σ = 169753393284. Its totient is φ = 152377061004.
The previous prime is 160842453631. The next prime is 160842453661. The reversal of 160842453643 is 346354248061.
160842453643 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-160842453643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 160842453593 and 160842453602.
It is not an unprimeable number, because it can be changed into a prime (160842453613) 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 5 ways as a sum of consecutive naturals, for example, 222773121 + ... + 222773842.
It is an arithmetic number, because the mean of its divisors is an integer number (28292232214).
Almost surely, 2160842453643 is an apocalyptic number.
160842453643 is a deficient number, since it is larger than the sum of its proper divisors (8910939641).
160842453643 is an equidigital number, since it uses as much as digits as its factorization.
160842453643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445547001 (or 445546982 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 46.
The spelling of 160842453643 in words is "one hundred sixty billion, eight hundred forty-two million, four hundred fifty-three thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •