Search a number
-
+
38099227141 is a prime number
BaseRepresentation
bin100011011110111001…
…000001001000000101
310122100012102021022201
4203132321001020011
51111011400232031
625300314354501
72516064041653
oct433671011005
9118305367281
1038099227141
1115181025288
12747342ba31
13379233acb1
141bb5d81dd3
15ecebc4d61
hex8dee41205

38099227141 has 2 divisors, whose sum is σ = 38099227142. Its totient is φ = 38099227140.

The previous prime is 38099227123. The next prime is 38099227147. The reversal of 38099227141 is 14172299083.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 35703614116 + 2395613025 = 188954^2 + 48945^2 .

It is an emirp because it is prime and its reverse (14172299083) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 38099227141 - 29 = 38099226629 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 238099227141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 217728, while the sum is 46.

The spelling of 38099227141 in words is "thirty-eight billion, ninety-nine million, two hundred twenty-seven thousand, one hundred forty-one".