Base | Representation |
---|---|
bin | 111100110010011001… |
… | …1011001010100000111 |
3 | 110110221120102221020122 |
4 | 1321210303121110013 |
5 | 4114321243313021 |
6 | 135545213452155 |
7 | 12300623335601 |
oct | 1714463312407 |
9 | 413846387218 |
10 | 130540213511 |
11 | 503a8602584 |
12 | 213717a105b |
13 | c404a996b6 |
14 | 646512c171 |
15 | 35e04c1bab |
hex | 1e64cd9507 |
130540213511 has 4 divisors (see below), whose sum is σ = 136215874992. Its totient is φ = 124864552032.
The previous prime is 130540213501. The next prime is 130540213567. The reversal of 130540213511 is 115312045031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 115312045031 = 123427 ⋅934253.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130540213511 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 (130540213501) 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, 2837830706 + ... + 2837830751.
It is an arithmetic number, because the mean of its divisors is an integer number (34053968748).
Almost surely, 2130540213511 is an apocalyptic number.
130540213511 is a deficient number, since it is larger than the sum of its proper divisors (5675661481).
130540213511 is an equidigital number, since it uses as much as digits as its factorization.
130540213511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5675661480.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 130540213511 its reverse (115312045031), we get a palindrome (245852258542).
The spelling of 130540213511 in words is "one hundred thirty billion, five hundred forty million, two hundred thirteen thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •