Base | Representation |
---|---|
bin | 10001101011000111010… |
… | …001100010001110110001 |
3 | 11022002220021020210110001 |
4 | 101223013101202032301 |
5 | 124344321123240423 |
6 | 2325540013110001 |
7 | 153514016002216 |
oct | 21530721421661 |
9 | 4262807223401 |
10 | 1214524040113 |
11 | 42909318142a |
12 | 177471788301 |
13 | 8a6b5647c97 |
14 | 42ad7453b0d |
15 | 218d4d34cad |
hex | 11ac74623b1 |
1214524040113 has 2 divisors, whose sum is σ = 1214524040114. Its totient is φ = 1214524040112.
The previous prime is 1214524040111. The next prime is 1214524040137. The reversal of 1214524040113 is 3110404254121.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 803473798689 + 411050241424 = 896367^2 + 641132^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214524040113 - 21 = 1214524040111 is a prime.
Together with 1214524040111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1214524040111) 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, 607262020056 + 607262020057.
It is an arithmetic number, because the mean of its divisors is an integer number (607262020057).
Almost surely, 21214524040113 is an apocalyptic number.
It is an amenable number.
1214524040113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214524040113 is an equidigital number, since it uses as much as digits as its factorization.
1214524040113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 1214524040113 its reverse (3110404254121), we get a palindrome (4324928294234).
The spelling of 1214524040113 in words is "one trillion, two hundred fourteen billion, five hundred twenty-four million, forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •