Base | Representation |
---|---|
bin | 111100100110001111… |
… | …0001111000011111111 |
3 | 110102220010100012211201 |
4 | 1321030132033003333 |
5 | 4113002243411221 |
6 | 135440512400331 |
7 | 12254535601546 |
oct | 1711436170377 |
9 | 412803305751 |
10 | 130132013311 |
11 | 50209146743 |
12 | 21278b460a7 |
13 | c36b346811 |
14 | 6426c3115d |
15 | 35b973d891 |
hex | 1e4c78f0ff |
130132013311 has 8 divisors (see below), whose sum is σ = 134753583744. Its totient is φ = 125536928160.
The previous prime is 130132013309. The next prime is 130132013351. The reversal of 130132013311 is 113310231031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130132013311 - 21 = 130132013309 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 (130132013351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6611320 + ... + 6630973.
It is an arithmetic number, because the mean of its divisors is an integer number (16844197968).
Almost surely, 2130132013311 is an apocalyptic number.
130132013311 is a deficient number, since it is larger than the sum of its proper divisors (4621570433).
130132013311 is a wasteful number, since it uses less digits than its factorization.
130132013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13242641.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 130132013311 its reverse (113310231031), we get a palindrome (243442244342).
It can be divided in two parts, 1301320 and 13311, that added together give a triangular number (1314631 = T1621).
The spelling of 130132013311 in words is "one hundred thirty billion, one hundred thirty-two million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •