Base | Representation |
---|---|
bin | 111101000011011001… |
… | …0001001100100010011 |
3 | 110112102022011221122022 |
4 | 1322012302021210103 |
5 | 4122003214442321 |
6 | 140121541002055 |
7 | 12321015160124 |
oct | 1720662114423 |
9 | 415368157568 |
10 | 131110312211 |
11 | 5067039812a |
12 | 214b06b332b |
13 | c495c261c8 |
14 | 64bab3004b |
15 | 3625584dab |
hex | 1e86c89913 |
131110312211 has 4 divisors (see below), whose sum is σ = 136810760592. Its totient is φ = 125409863832.
The previous prime is 131110312189. The next prime is 131110312237. The reversal of 131110312211 is 112213011131.
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 131110312211 - 234 = 113930443027 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131110312211.
It is not an unprimeable number, because it can be changed into a prime (131110314211) 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, 2850224156 + ... + 2850224201.
It is an arithmetic number, because the mean of its divisors is an integer number (34202690148).
Almost surely, 2131110312211 is an apocalyptic number.
131110312211 is a deficient number, since it is larger than the sum of its proper divisors (5700448381).
131110312211 is an equidigital number, since it uses as much as digits as its factorization.
131110312211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5700448380.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 131110312211 its reverse (112213011131), we get a palindrome (243323323342).
The spelling of 131110312211 in words is "one hundred thirty-one billion, one hundred ten million, three hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •