Search a number
-
+
1011021214253 is a prime number
BaseRepresentation
bin11101011011001011000…
…11110111001000101101
310120122121210210010012112
432231211203313020231
5113031032412324003
62052242353213405
7133021022346011
oct16554543671055
93518553703175
101011021214253
1135a854133326
12143b38b61265
13744537101ab
1436d1007a541
151b4740e63d8
hexeb658f722d

1011021214253 has 2 divisors, whose sum is σ = 1011021214254. Its totient is φ = 1011021214252.

The previous prime is 1011021214201. The next prime is 1011021214279. The reversal of 1011021214253 is 3524121201101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 527166027844 + 483855186409 = 726062^2 + 695597^2 .

It is a cyclic number.

It is not a de Polignac number, because 1011021214253 - 210 = 1011021213229 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21011021214253 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 480, while the sum is 23.

Adding to 1011021214253 its reverse (3524121201101), we get a palindrome (4535142415354).

The spelling of 1011021214253 in words is "one trillion, eleven billion, twenty-one million, two hundred fourteen thousand, two hundred fifty-three".