Base | Representation |
---|---|
bin | 1001010100011110101… |
… | …0100000011010100001 |
3 | 120022021202201101222101 |
4 | 2111013222200122201 |
5 | 10110404211140410 |
6 | 201320100010401 |
7 | 14365553344132 |
oct | 2250752403241 |
9 | 508252641871 |
10 | 160116115105 |
11 | 619a5411161 |
12 | 27046690a01 |
13 | 1213933349b |
14 | 7a6d0dbc89 |
15 | 4271c76d3a |
hex | 2547aa06a1 |
160116115105 has 4 divisors (see below), whose sum is σ = 192139338132. Its totient is φ = 128092892080.
The previous prime is 160116115057. The next prime is 160116115109. The reversal of 160116115105 is 501511611061.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 115716989584 + 44399125521 = 340172^2 + 210711^2 .
It is not a de Polignac number, because 160116115105 - 29 = 160116114593 is a prime.
It is a super-2 number, since 2×1601161151052 (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 (160116115109) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16011611506 + ... + 16011611515.
It is an arithmetic number, because the mean of its divisors is an integer number (48034834533).
Almost surely, 2160116115105 is an apocalyptic number.
It is an amenable number.
160116115105 is a deficient number, since it is larger than the sum of its proper divisors (32023223027).
160116115105 is an equidigital number, since it uses as much as digits as its factorization.
160116115105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32023223026.
The product of its (nonzero) digits is 900, while the sum is 28.
Adding to 160116115105 its reverse (501511611061), we get a palindrome (661627726166).
The spelling of 160116115105 in words is "one hundred sixty billion, one hundred sixteen million, one hundred fifteen thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •