Base | Representation |
---|---|
bin | 1001010100000110001… |
… | …1100110010110111101 |
3 | 120022000121220012010200 |
4 | 2111001203212112331 |
5 | 10110201443004044 |
6 | 201301555354113 |
7 | 14363200336215 |
oct | 2250143462675 |
9 | 508017805120 |
10 | 160013641149 |
11 | 6195258aa3a |
12 | 270182b2939 |
13 | 121210348cb |
14 | 7a5d665245 |
15 | 4267c84369 |
hex | 25418e65bd |
160013641149 has 12 divisors (see below), whose sum is σ = 231186873216. Its totient is φ = 106649887752.
The previous prime is 160013641147. The next prime is 160013641163. The reversal of 160013641149 is 941146310061.
160013641149 is a `hidden beast` number, since 1 + 6 + 0 + 0 + 1 + 3 + 641 + 1 + 4 + 9 = 666.
160013641149 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 160013641149 - 21 = 160013641147 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160013641147) 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, 2116879 + ... + 2191164.
It is an arithmetic number, because the mean of its divisors is an integer number (19265572768).
Almost surely, 2160013641149 is an apocalyptic number.
It is an amenable number.
160013641149 is a deficient number, since it is larger than the sum of its proper divisors (71173232067).
160013641149 is a wasteful number, since it uses less digits than its factorization.
160013641149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4312176 (or 4312173 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The spelling of 160013641149 in words is "one hundred sixty billion, thirteen million, six hundred forty-one thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •