Base | Representation |
---|---|
bin | 1010111101100101011000… |
… | …1000100111000111100101 |
3 | 1120200021012212222220102221 |
4 | 2233121112020213013211 |
5 | 3034434244033034113 |
6 | 41345043423232341 |
7 | 2352544426613125 |
oct | 257312610470745 |
9 | 46607185886387 |
10 | 12053123330533 |
11 | 392777899435a |
12 | 1427b867486b1 |
13 | 6957b256598c |
14 | 2d953505ac85 |
15 | 15d7e1abb98d |
hex | af6562271e5 |
12053123330533 has 2 divisors, whose sum is σ = 12053123330534. Its totient is φ = 12053123330532.
The previous prime is 12053123330399. The next prime is 12053123330593. The reversal of 12053123330533 is 33503332135021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12052825871524 + 297459009 = 3471718^2 + 17247^2 .
It is a cyclic number.
It is not a de Polignac number, because 12053123330533 - 29 = 12053123330021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12053123330593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6026561665266 + 6026561665267.
It is an arithmetic number, because the mean of its divisors is an integer number (6026561665267).
Almost surely, 212053123330533 is an apocalyptic number.
It is an amenable number.
12053123330533 is a deficient number, since it is larger than the sum of its proper divisors (1).
12053123330533 is an equidigital number, since it uses as much as digits as its factorization.
12053123330533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72900, while the sum is 34.
Adding to 12053123330533 its reverse (33503332135021), we get a palindrome (45556455465554).
The spelling of 12053123330533 in words is "twelve trillion, fifty-three billion, one hundred twenty-three million, three hundred thirty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •