Base | Representation |
---|---|
bin | 10110110001010101… |
… | …10101100001110001 |
3 | 1011112222120111200112 |
4 | 23120222311201301 |
5 | 200014102330140 |
6 | 5341025031105 |
7 | 611643101312 |
oct | 133052654161 |
9 | 34488514615 |
10 | 12225042545 |
11 | 5203799451 |
12 | 2452185495 |
13 | 11ca9794b1 |
14 | 83d87c609 |
15 | 4b83c4c65 |
hex | 2d8ab5871 |
12225042545 has 12 divisors (see below), whose sum is σ = 15019160436. Its totient is φ = 9552584160.
The previous prime is 12225042523. The next prime is 12225042553. The reversal of 12225042545 is 54524052221.
12225042545 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 8924769841 + 3300272704 = 94471^2 + 57448^2 .
It is not a de Polignac number, because 12225042545 - 28 = 12225042289 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 651926 + ... + 670415.
It is an arithmetic number, because the mean of its divisors is an integer number (1251596703).
Almost surely, 212225042545 is an apocalyptic number.
It is an amenable number.
12225042545 is a deficient number, since it is larger than the sum of its proper divisors (2794117891).
12225042545 is an equidigital number, since it uses as much as digits as its factorization.
12225042545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322432 (or 1322389 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 32.
Adding to 12225042545 its reverse (54524052221), we get a palindrome (66749094766).
The spelling of 12225042545 in words is "twelve billion, two hundred twenty-five million, forty-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •