Base | Representation |
---|---|
bin | 11110000011010101… |
… | …11010111101100101 |
3 | 1112122102021001102021 |
4 | 33001222322331211 |
5 | 231020320444013 |
6 | 11224550543141 |
7 | 1110551031034 |
oct | 170152727545 |
9 | 45572231367 |
10 | 16134156133 |
11 | 692a346337 |
12 | 3163367ab1 |
13 | 16a17c8664 |
14 | ad0ad471b |
15 | 646695a8d |
hex | 3c1abaf65 |
16134156133 has 4 divisors (see below), whose sum is σ = 16163122860. Its totient is φ = 16105189408.
The previous prime is 16134156121. The next prime is 16134156161. The reversal of 16134156133 is 33165143161.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 33165143161 = 99923 ⋅331907.
It can be written as a sum of positive squares in 2 ways, for example, as 3464852769 + 12669303364 = 58863^2 + 112558^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16134156133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16134156113) 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, 14482528 + ... + 14483641.
It is an arithmetic number, because the mean of its divisors is an integer number (4040780715).
Almost surely, 216134156133 is an apocalyptic number.
It is an amenable number.
16134156133 is a deficient number, since it is larger than the sum of its proper divisors (28966727).
16134156133 is an equidigital number, since it uses as much as digits as its factorization.
16134156133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28966726.
The product of its digits is 19440, while the sum is 34.
Adding to 16134156133 its reverse (33165143161), we get a palindrome (49299299294).
The spelling of 16134156133 in words is "sixteen billion, one hundred thirty-four million, one hundred fifty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •