Base | Representation |
---|---|
bin | 1011000111000000100111… |
… | …0101100101110001100101 |
3 | 1121020202011222102022000012 |
4 | 2301300021311211301211 |
5 | 3100112411310030000 |
6 | 41551303433300005 |
7 | 2400336243102014 |
oct | 261601165456145 |
9 | 47222158368005 |
10 | 12215052033125 |
11 | 398a4134772a7 |
12 | 1453438264605 |
13 | 6a7b4a275726 |
14 | 3032d6b8aa7b |
15 | 162b1ca36735 |
hex | b1c09d65c65 |
12215052033125 has 10 divisors (see below), whose sum is σ = 15263929021374. Its totient is φ = 9772041626000.
The previous prime is 12215052033097. The next prime is 12215052033127. The reversal of 12215052033125 is 52133025051221.
It can be written as a sum of positive squares in 5 ways, for example, as 8912189238241 + 3302862794884 = 2985329^2 + 1817378^2 .
It is a de Polignac number, because none of the positive numbers 2k-12215052033125 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12215052033091 and 12215052033100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12215052033127) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 9772041002 + ... + 9772042251.
Almost surely, 212215052033125 is an apocalyptic number.
It is an amenable number.
12215052033125 is a deficient number, since it is larger than the sum of its proper divisors (3048876988249).
12215052033125 is an frugal number, since it uses more digits than its factorization.
12215052033125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19544083273 (or 19544083258 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 12215052033125 its reverse (52133025051221), we get a palindrome (64348077084346).
The spelling of 12215052033125 in words is "twelve trillion, two hundred fifteen billion, fifty-two million, thirty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •