Base | Representation |
---|---|
bin | 1011000010001000010100… |
… | …0101110000110001110111 |
3 | 1120221201210121122101210110 |
4 | 2300202011011300301313 |
5 | 3042224214423233101 |
6 | 41445001125154103 |
7 | 2361310645036221 |
oct | 260420505606167 |
9 | 46851717571713 |
10 | 12131220524151 |
11 | 39579047a8883 |
12 | 143b14125b933 |
13 | 69cc7a3c3751 |
14 | 2dd2231db411 |
15 | 160862ec5cd6 |
hex | b0885170c77 |
12131220524151 has 32 divisors (see below), whose sum is σ = 17576494214400. Its totient is φ = 7414084431360.
The previous prime is 12131220524147. The next prime is 12131220524167. The reversal of 12131220524151 is 15142502213121.
It is not a de Polignac number, because 12131220524151 - 22 = 12131220524147 is a prime.
It is a super-2 number, since 2×121312205241512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131220524851) 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 31 ways as a sum of consecutive naturals, for example, 18165805 + ... + 18821766.
It is an arithmetic number, because the mean of its divisors is an integer number (549265444200).
Almost surely, 212131220524151 is an apocalyptic number.
12131220524151 is a deficient number, since it is larger than the sum of its proper divisors (5445273690249).
12131220524151 is a wasteful number, since it uses less digits than its factorization.
12131220524151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36987759.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 12131220524151 its reverse (15142502213121), we get a palindrome (27273722737272).
The spelling of 12131220524151 in words is "twelve trillion, one hundred thirty-one billion, two hundred twenty million, five hundred twenty-four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •