Search a number
-
+
2030150233 is a prime number
BaseRepresentation
bin111100100000001…
…1010001001011001
312020111002022120101
41321000122021121
513124204301413
6533241055401
7101210664226
oct17100321131
95214068511
102030150233
11951a6aa11
12487a87561
132647a2837
141538a694d
15bd36aedd
hex7901a259

2030150233 has 2 divisors, whose sum is σ = 2030150234. Its totient is φ = 2030150232.

The previous prime is 2030150231. The next prime is 2030150237. The reversal of 2030150233 is 3320510302.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 2020682304 + 9467929 = 44952^2 + 3077^2 .

It is a cyclic number.

It is not a de Polignac number, because 2030150233 - 21 = 2030150231 is a prime.

Together with 2030150231, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 2030150233.

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

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

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

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

Almost surely, 22030150233 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 19.

The square root of 2030150233 is about 45057.1884719852. The cubic root of 2030150233 is about 1266.2206516100.

Adding to 2030150233 its reverse (3320510302), we get a palindrome (5350660535).

The spelling of 2030150233 in words is "two billion, thirty million, one hundred fifty thousand, two hundred thirty-three".