Search a number
BaseRepresentation
bin11010001001111100000110…
…110111010010001000011011
3120002021222021111021010102002
4122021330012313102020123
5110034141443401304001
61044353024013431215
733141542516033666
oct3211740667221033
9502258244233362
10115032224244251
113371a98a77a376
1210a9a02319b50b
134c2565249a372
1420598372c06dd
15d473bae6846b
hex689f06dd221b

115032224244251 has 2 divisors, whose sum is σ = 115032224244252. Its totient is φ = 115032224244250.

The previous prime is 115032224244109. The next prime is 115032224244263. The reversal of 115032224244251 is 152442422230511.

Adding to 115032224244251 its reverse (152442422230511), we get a palindrome (267474646474762).

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 115032224244251 - 214 = 115032224227867 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2115032224244251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 153600, while the sum is 38.

The spelling of 115032224244251 in words is "one hundred fifteen trillion, thirty-two billion, two hundred twenty-four million, two hundred forty-four thousand, two hundred fifty-one".