Search a number
-
+
1546214234137 is a prime number
BaseRepresentation
bin10110100000000001100…
…011001101100000011001
312110211001022212110212221
4112200001203031200121
5200313121320443022
63142153201104041
7216465426065026
oct26400143154031
95424038773787
101546214234137
11546822697521
1220b800028021
13b2a65a63a91
1454ba129254d
152a3496d5cc7
hex168018cd819

1546214234137 has 2 divisors, whose sum is σ = 1546214234138. Its totient is φ = 1546214234136.

The previous prime is 1546214234093. The next prime is 1546214234171. The reversal of 1546214234137 is 7314324126451.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 974684282121 + 571529952016 = 987261^2 + 755996^2 .

It is a cyclic number.

It is not a de Polignac number, because 1546214234137 - 27 = 1546214234009 is a prime.

It is a super-2 number, since 2×15462142341372 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1546214234093 and 1546214234102.

It is not a weakly prime, because it can be changed into another prime (1546214234837) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 773107117068 + 773107117069.

It is an arithmetic number, because the mean of its divisors is an integer number (773107117069).

Almost surely, 21546214234137 is an apocalyptic number.

It is an amenable number.

1546214234137 is a deficient number, since it is larger than the sum of its proper divisors (1).

1546214234137 is an equidigital number, since it uses as much as digits as its factorization.

1546214234137 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 483840, while the sum is 43.

The spelling of 1546214234137 in words is "one trillion, five hundred forty-six billion, two hundred fourteen million, two hundred thirty-four thousand, one hundred thirty-seven".