Base | Representation |
---|---|
bin | 1011000010000111001100… |
… | …0001001110000100111011 |
3 | 1120221201000111011020012012 |
4 | 2300201303001032010323 |
5 | 3042223104314443142 |
6 | 41444511055040135 |
7 | 2361300304041602 |
oct | 260416301160473 |
9 | 46851014136165 |
10 | 12130917343547 |
11 | 39577696517a2 |
12 | 143b07781004b |
13 | 69cc2c651042 |
14 | 2dd1d4c3aa39 |
15 | 160846589882 |
hex | b087304e13b |
12130917343547 has 4 divisors (see below), whose sum is σ = 12131302324680. Its totient is φ = 12130532362416.
The previous prime is 12130917343537. The next prime is 12130917343609. The reversal of 12130917343547 is 74534371903121.
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 12130917343547 - 26 = 12130917343483 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12130917343495 and 12130917343504.
It is not an unprimeable number, because it can be changed into a prime (12130917343537) 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, 192443297 + ... + 192506322.
It is an arithmetic number, because the mean of its divisors is an integer number (3032825581170).
Almost surely, 212130917343547 is an apocalyptic number.
12130917343547 is a deficient number, since it is larger than the sum of its proper divisors (384981133).
12130917343547 is an equidigital number, since it uses as much as digits as its factorization.
12130917343547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384981132.
The product of its (nonzero) digits is 1905120, while the sum is 50.
The spelling of 12130917343547 in words is "twelve trillion, one hundred thirty billion, nine hundred seventeen million, three hundred forty-three thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •