Base | Representation |
---|---|
bin | 111100101011110110… |
… | …0100010010000011011 |
3 | 110110101020122202011011 |
4 | 1321113230202100123 |
5 | 4113343444430243 |
6 | 135511320314351 |
7 | 12262313240416 |
oct | 1712754422033 |
9 | 413336582134 |
10 | 130320311323 |
11 | 502a5466834 |
12 | 213100129b7 |
13 | c39b364667 |
14 | 6443c48b7d |
15 | 35cb03589d |
hex | 1e57b2241b |
130320311323 has 4 divisors (see below), whose sum is σ = 131585557168. Its totient is φ = 129055065480.
The previous prime is 130320311321. The next prime is 130320311357. The reversal of 130320311323 is 323113023031.
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 130320311323 - 21 = 130320311321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130320311294 and 130320311303.
It is not an unprimeable number, because it can be changed into a prime (130320311321) 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, 632622768 + ... + 632622973.
It is an arithmetic number, because the mean of its divisors is an integer number (32896389292).
Almost surely, 2130320311323 is an apocalyptic number.
130320311323 is a deficient number, since it is larger than the sum of its proper divisors (1265245845).
130320311323 is a wasteful number, since it uses less digits than its factorization.
130320311323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1265245844.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130320311323 its reverse (323113023031), we get a palindrome (453433334354).
The spelling of 130320311323 in words is "one hundred thirty billion, three hundred twenty million, three hundred eleven thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •