Base | Representation |
---|---|
bin | 10001101010101111010… |
… | …000001011101010100001 |
3 | 11022001212011220212201201 |
4 | 101222233100023222201 |
5 | 124343004441013403 |
6 | 2325432015201201 |
7 | 153501023332405 |
oct | 21525720135241 |
9 | 4261764825651 |
10 | 1214121032353 |
11 | 4289a6741769 |
12 | 17737a816201 |
13 | 8a64ccc2658 |
14 | 42a99b09105 |
15 | 218ae77a21d |
hex | 11aaf40baa1 |
1214121032353 has 2 divisors, whose sum is σ = 1214121032354. Its totient is φ = 1214121032352.
The previous prime is 1214121032351. The next prime is 1214121032357. The reversal of 1214121032353 is 3532301214121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 621271851264 + 592849181089 = 788208^2 + 769967^2 .
It is a cyclic number.
It is not a de Polignac number, because 1214121032353 - 21 = 1214121032351 is a prime.
Together with 1214121032351, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1214121032351) 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, 607060516176 + 607060516177.
It is an arithmetic number, because the mean of its divisors is an integer number (607060516177).
Almost surely, 21214121032353 is an apocalyptic number.
It is an amenable number.
1214121032353 is a deficient number, since it is larger than the sum of its proper divisors (1).
1214121032353 is an equidigital number, since it uses as much as digits as its factorization.
1214121032353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 1214121032353 its reverse (3532301214121), we get a palindrome (4746422246474).
The spelling of 1214121032353 in words is "one trillion, two hundred fourteen billion, one hundred twenty-one million, thirty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •