Search a number
-
+
110000021021269 is a prime number
BaseRepresentation
bin11001000000101101100000…
…001011011010001001010101
3112102110220021121002202212121
4121000231200023122021111
5103404220020340140034
61025541151222215541
732112145031301211
oct3100554013321125
9472426247082777
10110000021021269
113205a824198845
12104068a85845b1
13494bc5a751692
141d2405aa53941
15cab5464b61b4
hex640b602da255

110000021021269 has 2 divisors, whose sum is σ = 110000021021270. Its totient is φ = 110000021021268.

The previous prime is 110000021021213. The next prime is 110000021021291. The reversal of 110000021021269 is 962120120000011.

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., 106515403596900 + 3484617424369 = 10320630^2 + 1866713^2 .

It is a cyclic number.

It is not a de Polignac number, because 110000021021269 - 27 = 110000021021141 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110000021021299) 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, 55000010510634 + 55000010510635.

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

Almost surely, 2110000021021269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 432, while the sum is 25.

The spelling of 110000021021269 in words is "one hundred ten trillion, twenty-one million, twenty-one thousand, two hundred sixty-nine".