Base | Representation |
---|---|
bin | 111100100101100111… |
… | …1101001010000001011 |
3 | 110102211200120112001222 |
4 | 1321023033221100023 |
5 | 4112432010124321 |
6 | 135434455032255 |
7 | 12254165514245 |
oct | 1711317512013 |
9 | 412750515058 |
10 | 130111411211 |
11 | 501a8555011 |
12 | 2127206b68b |
13 | c366cb2322 |
14 | 64241cb095 |
15 | 35b7a1e3ab |
hex | 1e4b3e940b |
130111411211 has 4 divisors (see below), whose sum is σ = 132566343552. Its totient is φ = 127656478872.
The previous prime is 130111411201. The next prime is 130111411219. The reversal of 130111411211 is 112114111031.
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 130111411211 - 214 = 130111394827 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 130111411211.
It is not an unprimeable number, because it can be changed into a prime (130111411219) 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, 1227466091 + ... + 1227466196.
It is an arithmetic number, because the mean of its divisors is an integer number (33141585888).
Almost surely, 2130111411211 is an apocalyptic number.
130111411211 is a deficient number, since it is larger than the sum of its proper divisors (2454932341).
130111411211 is an equidigital number, since it uses as much as digits as its factorization.
130111411211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2454932340.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 130111411211 its reverse (112114111031), we get a palindrome (242225522242).
The spelling of 130111411211 in words is "one hundred thirty billion, one hundred eleven million, four hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •