Base | Representation |
---|---|
bin | 111100100110001111… |
… | …0001110100100101111 |
3 | 110102220010100010002122 |
4 | 1321030132032210233 |
5 | 4113002243330221 |
6 | 135440512343155 |
7 | 12254535562661 |
oct | 1711436164457 |
9 | 412803303078 |
10 | 130132011311 |
11 | 50209145195 |
12 | 21278b44abb |
13 | c36b345933 |
14 | 6426c30531 |
15 | 35b973ceab |
hex | 1e4c78e92f |
130132011311 has 4 divisors (see below), whose sum is σ = 130555894392. Its totient is φ = 129708128232.
The previous prime is 130132011307. The next prime is 130132011337. The reversal of 130132011311 is 113110231031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113110231031 = 7 ⋅16158604433.
It is a cyclic number.
It is not a de Polignac number, because 130132011311 - 22 = 130132011307 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 130132011311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130132011371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211941080 + ... + 211941693.
It is an arithmetic number, because the mean of its divisors is an integer number (32638973598).
Almost surely, 2130132011311 is an apocalyptic number.
130132011311 is a deficient number, since it is larger than the sum of its proper divisors (423883081).
130132011311 is an equidigital number, since it uses as much as digits as its factorization.
130132011311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423883080.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 130132011311 its reverse (113110231031), we get a palindrome (243242242342).
The spelling of 130132011311 in words is "one hundred thirty billion, one hundred thirty-two million, eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •