Base | Representation |
---|---|
bin | 110011010010001100… |
… | …0110110011010000011 |
3 | 101112021022002101222202 |
4 | 1212210120312122003 |
5 | 3301022313111011 |
6 | 122332150223415 |
7 | 10646114625650 |
oct | 1464430663203 |
9 | 345238071882 |
10 | 110132160131 |
11 | 42785807a64 |
12 | 19417054b6b |
13 | a5019c0976 |
14 | 548a986c27 |
15 | 2ce8a0123b |
hex | 19a4636683 |
110132160131 has 4 divisors (see below), whose sum is σ = 125865325872. Its totient is φ = 94398994392.
The previous prime is 110132160077. The next prime is 110132160133. The reversal of 110132160131 is 131061231011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110132160131 is a prime.
It is a super-2 number, since 2×1101321601312 (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 (110132160133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7866582860 + ... + 7866582873.
It is an arithmetic number, because the mean of its divisors is an integer number (31466331468).
Almost surely, 2110132160131 is an apocalyptic number.
110132160131 is a deficient number, since it is larger than the sum of its proper divisors (15733165741).
110132160131 is an equidigital number, since it uses as much as digits as its factorization.
110132160131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15733165740.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 110132160131 its reverse (131061231011), we get a palindrome (241193391142).
The spelling of 110132160131 in words is "one hundred ten billion, one hundred thirty-two million, one hundred sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •