Base | Representation |
---|---|
bin | 111100101011111011… |
… | …1010000101101000101 |
3 | 110110101102221121001211 |
4 | 1321113313100231011 |
5 | 4113400204414023 |
6 | 135511500451421 |
7 | 12262346160646 |
oct | 1712767205505 |
9 | 413342847054 |
10 | 130323123013 |
11 | 502a7007246 |
12 | 21310b49b71 |
13 | c39bb0a395 |
14 | 644437b6cd |
15 | 35cb3dda0d |
hex | 1e57dd0b45 |
130323123013 has 4 divisors (see below), whose sum is σ = 132268244320. Its totient is φ = 128378001708.
The previous prime is 130323122999. The next prime is 130323123019. The reversal of 130323123013 is 310321323031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 310321323031 = 22811 ⋅13604021.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130323123013 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 (130323123019) 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, 972560553 + ... + 972560686.
It is an arithmetic number, because the mean of its divisors is an integer number (33067061080).
Almost surely, 2130323123013 is an apocalyptic number.
It is an amenable number.
130323123013 is a deficient number, since it is larger than the sum of its proper divisors (1945121307).
130323123013 is an equidigital number, since it uses as much as digits as its factorization.
130323123013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1945121306.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130323123013 its reverse (310321323031), we get a palindrome (440644446044).
The spelling of 130323123013 in words is "one hundred thirty billion, three hundred twenty-three million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •