Search a number
-
+
1030201099229 is a prime number
BaseRepresentation
bin11101111110111001100…
…01010100001111011101
310122111010111010020010202
432333130301110033131
5113334322440133404
62105133504513245
7134300225601011
oct16773461241735
93574114106122
101030201099229
113679a6732835
121477b031b825
13761bc211363
1437c0d47c541
151bbe7d6521e
hexefdcc543dd

1030201099229 has 2 divisors, whose sum is σ = 1030201099230. Its totient is φ = 1030201099228.

The previous prime is 1030201099223. The next prime is 1030201099247. The reversal of 1030201099229 is 9229901020301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1019540536729 + 10660562500 = 1009723^2 + 103250^2 .

It is a cyclic number.

It is not a de Polignac number, because 1030201099229 - 28 = 1030201098973 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21030201099229 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1030201099229 in words is "one trillion, thirty billion, two hundred one million, ninety-nine thousand, two hundred twenty-nine".