Base | Representation |
---|---|
bin | 1001010100001111111… |
… | …1011001000010100011 |
3 | 120022010110202001221221 |
4 | 2111003333121002203 |
5 | 10110242421343214 |
6 | 201310014555511 |
7 | 14364204433054 |
oct | 2250377310243 |
9 | 508113661857 |
10 | 160054481059 |
11 | 61973644630 |
12 | 27029b08b97 |
13 | 12129633835 |
14 | 7a64c5672b |
15 | 426b64ee24 |
hex | 2543fd90a3 |
160054481059 has 4 divisors (see below), whose sum is σ = 174604888440. Its totient is φ = 145504073680.
The previous prime is 160054481053. The next prime is 160054481107. The reversal of 160054481059 is 950184450061.
160054481059 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 160054481059 - 213 = 160054472867 is a prime.
It is a super-2 number, since 2×1600544810592 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (160054481053) 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 3 ways as a sum of consecutive naturals, for example, 7275203674 + ... + 7275203695.
It is an arithmetic number, because the mean of its divisors is an integer number (43651222110).
Almost surely, 2160054481059 is an apocalyptic number.
160054481059 is a deficient number, since it is larger than the sum of its proper divisors (14550407381).
160054481059 is a wasteful number, since it uses less digits than its factorization.
160054481059 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14550407380.
The product of its (nonzero) digits is 172800, while the sum is 43.
The spelling of 160054481059 in words is "one hundred sixty billion, fifty-four million, four hundred eighty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •