Base | Representation |
---|---|
bin | 1011000010001100000101… |
… | …0100100010010101110101 |
3 | 1120221211102001002102101221 |
4 | 2300203001110202111311 |
5 | 3042233302120431013 |
6 | 41445245303550341 |
7 | 2361344665144624 |
oct | 260430124422565 |
9 | 46854361072357 |
10 | 12132231030133 |
11 | 3958283147995 |
12 | 143b38375b3b1 |
13 | 6a00ab86b896 |
14 | 2dd2bb4c16bb |
15 | 1608c1a8008d |
hex | b08c1522575 |
12132231030133 has 2 divisors, whose sum is σ = 12132231030134. Its totient is φ = 12132231030132.
The previous prime is 12132231030121. The next prime is 12132231030151. The reversal of 12132231030133 is 33103013223121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11820552238609 + 311678791524 = 3438103^2 + 558282^2 .
It is a cyclic number.
It is not a de Polignac number, because 12132231030133 - 29 = 12132231029621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12132231030098 and 12132231030107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12132231030103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6066115515066 + 6066115515067.
It is an arithmetic number, because the mean of its divisors is an integer number (6066115515067).
Almost surely, 212132231030133 is an apocalyptic number.
It is an amenable number.
12132231030133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12132231030133 is an equidigital number, since it uses as much as digits as its factorization.
12132231030133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 12132231030133 its reverse (33103013223121), we get a palindrome (45235244253254).
The spelling of 12132231030133 in words is "twelve trillion, one hundred thirty-two billion, two hundred thirty-one million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •