Base | Representation |
---|---|
bin | 10111010101101101… |
… | …11111110011010101 |
3 | 1012100020211010210022 |
4 | 23222312333303111 |
5 | 201130214021440 |
6 | 5431210034525 |
7 | 622340054234 |
oct | 135266776325 |
9 | 35306733708 |
10 | 12530220245 |
11 | 534aa89a24 |
12 | 2518418a45 |
13 | 1248c6ac0a |
14 | 86c1dcb1b |
15 | 4d50a7cb5 |
hex | 2eadbfcd5 |
12530220245 has 4 divisors (see below), whose sum is σ = 15036264300. Its totient is φ = 10024176192.
The previous prime is 12530220233. The next prime is 12530220259. The reversal of 12530220245 is 54202203521.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54202203521 = 17 ⋅3188364913.
It can be written as a sum of positive squares in 2 ways, for example, as 3126263569 + 9403956676 = 55913^2 + 96974^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12530220245 is a prime.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1253022020 + ... + 1253022029.
It is an arithmetic number, because the mean of its divisors is an integer number (3759066075).
Almost surely, 212530220245 is an apocalyptic number.
It is an amenable number.
12530220245 is a deficient number, since it is larger than the sum of its proper divisors (2506044055).
12530220245 is an equidigital number, since it uses as much as digits as its factorization.
12530220245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2506044054.
The product of its (nonzero) digits is 4800, while the sum is 26.
Adding to 12530220245 its reverse (54202203521), we get a palindrome (66732423766).
The spelling of 12530220245 in words is "twelve billion, five hundred thirty million, two hundred twenty thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •