Base | Representation |
---|---|
bin | 1011011001010110010001… |
… | …1110100110100111100011 |
3 | 1122100212101120210212200110 |
4 | 2312111210132212213203 |
5 | 3120243123432042111 |
6 | 42352130111222403 |
7 | 2432161456061433 |
oct | 266254436464743 |
9 | 48325346725613 |
10 | 12530105346531 |
11 | 3aa0a95899783 |
12 | 14a4502b17a03 |
13 | 6cb778998976 |
14 | 3146632302c3 |
15 | 16ae0ba3b5a6 |
hex | b65647a69e3 |
12530105346531 has 8 divisors (see below), whose sum is σ = 16908093961920. Its totient is φ = 8252760147752.
The previous prime is 12530105346457. The next prime is 12530105346541. The reversal of 12530105346531 is 13564350103521.
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 12530105346531 - 214 = 12530105330147 is a prime.
It is a super-2 number, since 2×125301053465312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12530105346531.
It is not an unprimeable number, because it can be changed into a prime (12530105346541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25160853861 + ... + 25160854358.
It is an arithmetic number, because the mean of its divisors is an integer number (2113511745240).
Almost surely, 212530105346531 is an apocalyptic number.
12530105346531 is a deficient number, since it is larger than the sum of its proper divisors (4377988615389).
12530105346531 is an equidigital number, since it uses as much as digits as its factorization.
12530105346531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50321708305.
The product of its (nonzero) digits is 162000, while the sum is 39.
The spelling of 12530105346531 in words is "twelve trillion, five hundred thirty billion, one hundred five million, three hundred forty-six thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •