Base | Representation |
---|---|
bin | 10110110110000000… |
… | …10111110110000101 |
3 | 1011122201100002000010 |
4 | 23123000113312011 |
5 | 200104121230230 |
6 | 5344545140433 |
7 | 612630225141 |
oct | 133300276605 |
9 | 34581302003 |
10 | 12264242565 |
11 | 5223932a63 |
12 | 246332a719 |
13 | 1205b22b83 |
14 | 844b64221 |
15 | 4bba699b0 |
hex | 2db017d85 |
12264242565 has 16 divisors (see below), whose sum is σ = 19636848000. Its totient is φ = 6536242752.
The previous prime is 12264242533. The next prime is 12264242567. The reversal of 12264242565 is 56524246221.
12264242565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12264242565 - 25 = 12264242533 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12264242567) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 271230 + ... + 313199.
It is an arithmetic number, because the mean of its divisors is an integer number (1227303000).
Almost surely, 212264242565 is an apocalyptic number.
12264242565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12264242565 is a deficient number, since it is larger than the sum of its proper divisors (7372605435).
12264242565 is a wasteful number, since it uses less digits than its factorization.
12264242565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 585836.
The product of its digits is 230400, while the sum is 39.
Adding to 12264242565 its reverse (56524246221), we get a palindrome (68788488786).
The spelling of 12264242565 in words is "twelve billion, two hundred sixty-four million, two hundred forty-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •