Search a number
-
+
10121303032 = 232814502359
BaseRepresentation
bin10010110110100011…
…01101001111111000
3222010101000110121021
421123101231033320
5131212023144112
64352154352224
7505546441051
oct113321551770
928111013537
1010121303032
114324236855
121b6572b674
13c53b7c509
146c02db728
153e386e907
hex25b46d3f8

10121303032 has 16 divisors (see below), whose sum is σ = 19044982800. Its totient is φ = 5042640960.

The previous prime is 10121303029. The next prime is 10121303033. The reversal of 10121303032 is 23030312101.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2248932 + ... + 2253427.

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

Almost surely, 210121303032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 108, while the sum is 16.

Adding to 10121303032 its reverse (23030312101), we get a palindrome (33151615133).

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

Divisors: 1 2 4 8 281 562 1124 2248 4502359 9004718 18009436 36018872 1265162879 2530325758 5060651516 10121303032