Search a number
-
+
10302531233 = 172334710651
BaseRepresentation
bin10011001100001010…
…00010011010100001
3222121000000210221212
421212011002122201
5132044421444413
64422150555505
7513210033131
oct114605023241
928530023855
1010302531233
114407568225
121bb6368b95
13c82593437
146da3d4ac1
1540471bca8
hex2661426a1

10302531233 has 12 divisors (see below), whose sum is σ = 10948509072. Its totient is φ = 9692692800.

The previous prime is 10302531229. The next prime is 10302531247. The reversal of 10302531233 is 33213520301.

It is not a de Polignac number, because 10302531233 - 22 = 10302531229 is a prime.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (10302531203) 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 in 11 ways as a sum of consecutive naturals, for example, 961958 + ... + 972608.

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

Almost surely, 210302531233 is an apocalyptic number.

It is an amenable number.

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

10302531233 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 14032 (or 14015 counting only the distinct ones).

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

The spelling of 10302531233 in words is "ten billion, three hundred two million, five hundred thirty-one thousand, two hundred thirty-three".

Divisors: 1 17 289 3347 10651 56899 181067 967283 3078139 35648897 606031249 10302531233