Base | Representation |
---|---|
bin | 111100100101010010… |
… | …0100010101010001011 |
3 | 110102210220022110111002 |
4 | 1321022210202222023 |
5 | 4112421112041021 |
6 | 135433412525215 |
7 | 12254000464052 |
oct | 1711244425213 |
9 | 412726273432 |
10 | 130100112011 |
11 | 501a2137831 |
12 | 2126a32080b |
13 | c3648572cc |
14 | 64228c9399 |
15 | 35b6a3b50b |
hex | 1e4a922a8b |
130100112011 has 8 divisors (see below), whose sum is σ = 134590761120. Its totient is φ = 125609758848.
The previous prime is 130100111959. The next prime is 130100112013. The reversal of 130100112011 is 110211001031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130100112011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130100111983 and 130100112001.
It is not an unprimeable number, because it can be changed into a prime (130100112013) 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 7 ways as a sum of consecutive naturals, for example, 1182050 + ... + 1287416.
It is an arithmetic number, because the mean of its divisors is an integer number (16823845140).
Almost surely, 2130100112011 is an apocalyptic number.
130100112011 is a deficient number, since it is larger than the sum of its proper divisors (4490649109).
130100112011 is a wasteful number, since it uses less digits than its factorization.
130100112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147973.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 130100112011 its reverse (110211001031), we get a palindrome (240311113042).
The spelling of 130100112011 in words is "one hundred thirty billion, one hundred million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •