Base | Representation |
---|---|
bin | 10110110110001011… |
… | …01000111011010101 |
3 | 1011122210221012221201 |
4 | 23123011220323111 |
5 | 200104444421003 |
6 | 5345034512501 |
7 | 612645035362 |
oct | 133305507325 |
9 | 34583835851 |
10 | 12265623253 |
11 | 5224696324 |
12 | 2463895731 |
13 | 12061b7450 |
14 | 845003469 |
15 | 4bbc3db1d |
hex | 2db168ed5 |
12265623253 has 8 divisors (see below), whose sum is σ = 13210062488. Its totient is φ = 11321316864.
The previous prime is 12265623239. The next prime is 12265623257. The reversal of 12265623253 is 35232656221.
It can be written as a sum of positive squares in 4 ways, for example, as 5455742769 + 6809880484 = 73863^2 + 82522^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12265623253 - 229 = 11728752341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12265623257) 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 7 ways as a sum of consecutive naturals, for example, 244801 + ... + 290617.
It is an arithmetic number, because the mean of its divisors is an integer number (1651257811).
Almost surely, 212265623253 is an apocalyptic number.
12265623253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12265623253 is a deficient number, since it is larger than the sum of its proper divisors (944439235).
12265623253 is a wasteful number, since it uses less digits than its factorization.
12265623253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66423.
The product of its digits is 129600, while the sum is 37.
The spelling of 12265623253 in words is "twelve billion, two hundred sixty-five million, six hundred twenty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •