Base | Representation |
---|---|
bin | 1010111100011011101010… |
… | …0011101001011101110101 |
3 | 1120121101010200120100111001 |
4 | 2233012322203221131311 |
5 | 3034123231311200112 |
6 | 41332011554243301 |
7 | 2351244134300245 |
oct | 257067243513565 |
9 | 46541120510431 |
10 | 12033333303157 |
11 | 391a342a39931 |
12 | 1424182b86531 |
13 | 69397a5275ca |
14 | 2d85b89d1b25 |
15 | 15d0344c9c57 |
hex | af1ba8e9775 |
12033333303157 has 2 divisors, whose sum is σ = 12033333303158. Its totient is φ = 12033333303156.
The previous prime is 12033333303151. The next prime is 12033333303227. The reversal of 12033333303157 is 75130333333021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6043170057796 + 5990163245361 = 2458286^2 + 2447481^2 .
It is a cyclic number.
It is not a de Polignac number, because 12033333303157 - 211 = 12033333301109 is a prime.
It is a super-2 number, since 2×120333333031572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12033333303151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6016666651578 + 6016666651579.
It is an arithmetic number, because the mean of its divisors is an integer number (6016666651579).
Almost surely, 212033333303157 is an apocalyptic number.
It is an amenable number.
12033333303157 is a deficient number, since it is larger than the sum of its proper divisors (1).
12033333303157 is an equidigital number, since it uses as much as digits as its factorization.
12033333303157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 153090, while the sum is 37.
Adding to 12033333303157 its reverse (75130333333021), we get a palindrome (87163666636178).
The spelling of 12033333303157 in words is "twelve trillion, thirty-three billion, three hundred thirty-three million, three hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •