Search a number
-
+
10302002302 = 25151001151
BaseRepresentation
bin10011001100000110…
…00001010001111110
3222120222000221101211
421212003001101332
5132044303033202
64422131355034
7513202401064
oct114603012176
928528027354
1010302002302
114407236899
121bb6152a7a
13c82439767
146da2d8034
154046651d7
hex2660c147e

10302002302 has 4 divisors (see below), whose sum is σ = 15453003456. Its totient is φ = 5151001150.

The previous prime is 10302002297. The next prime is 10302002303. The reversal of 10302002302 is 20320020301.

It is a happy number.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 20320020301 = 72902860043.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10302002303) by changing a digit.

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

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

Almost surely, 210302002302 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5151001153.

The product of its (nonzero) digits is 72, while the sum is 13.

Adding to 10302002302 its reverse (20320020301), we get a palindrome (30622022603).

The spelling of 10302002302 in words is "ten billion, three hundred two million, two thousand, three hundred two".

Divisors: 1 2 5151001151 10302002302