Base | Representation |
---|---|
bin | 1011000000010100110000… |
… | …1011101011010010010101 |
3 | 1120211202201210221102010121 |
4 | 2300011030023223102111 |
5 | 3041222202424032013 |
6 | 41422431113151541 |
7 | 2356132155331036 |
oct | 260051413532225 |
9 | 46752653842117 |
10 | 12100201002133 |
11 | 3945737017872 |
12 | 14351249bb5b1 |
13 | 69a075a477aa |
14 | 2db91d602a8d |
15 | 15eb49b1158d |
hex | b014c2eb495 |
12100201002133 has 2 divisors, whose sum is σ = 12100201002134. Its totient is φ = 12100201002132.
The previous prime is 12100201002091. The next prime is 12100201002139. The reversal of 12100201002133 is 33120010200121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9307368436804 + 2792832565329 = 3050798^2 + 1671177^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100201002133 - 213 = 12100200993941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12100201002139) 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 as a sum of consecutive naturals, namely, 6050100501066 + 6050100501067.
It is an arithmetic number, because the mean of its divisors is an integer number (6050100501067).
Almost surely, 212100201002133 is an apocalyptic number.
It is an amenable number.
12100201002133 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100201002133 is an equidigital number, since it uses as much as digits as its factorization.
12100201002133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12100201002133 its reverse (33120010200121), we get a palindrome (45220211202254).
The spelling of 12100201002133 in words is "twelve trillion, one hundred billion, two hundred one million, two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •