Search a number
-
+
10302002013 = 323673221849
BaseRepresentation
bin10011001100000110…
…00001001101011101
3222120222000221000010
421212003001031131
5132044303031023
64422131353433
7513202400202
oct114603011535
928528027003
1010302002013
114407236656
121bb6152879
13c824395a4
146da2d7ca9
15404665093
hex2660c135d

10302002013 has 16 divisors (see below), whose sum is σ = 14354582400. Its totient is φ = 6559601664.

The previous prime is 10302001961. The next prime is 10302002069. The reversal of 10302002013 is 31020020301.

It is a happy number.

It is not a de Polignac number, because 10302002013 - 28 = 10302001757 is a prime.

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

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 64488 + ... + 157361.

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

Almost surely, 210302002013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 222548.

The product of its (nonzero) digits is 36, while the sum is 12.

Adding to 10302002013 its reverse (31020020301), we get a palindrome (41322022314).

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

Divisors: 1 3 23 69 673 2019 15479 46437 221849 665547 5102527 15307581 149304377 447913131 3434000671 10302002013