Search a number
-
+
10003151022 = 234649358613
BaseRepresentation
bin10010101000011101…
…11111100010101110
3221211010200201111220
421110032333202232
5130441301313042
64332334124210
7502613244414
oct112416774256
927733621456
1010003151022
114273577467
121b32050666
13c35551797
146ac7432b4
153d82d18ec
hex2543bf8ae

10003151022 has 16 divisors (see below), whose sum is σ = 20010661200. Its totient is φ = 3333657152.

The previous prime is 10003151009. The next prime is 10003151023. The reversal of 10003151022 is 22015130001.

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

It is a congruent number.

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

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

Almost surely, 210003151022 is an apocalyptic number.

10003151022 is an abundant number, since it is smaller than the sum of its proper divisors (10007510178).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 363267.

The product of its (nonzero) digits is 60, while the sum is 15.

Adding to 10003151022 its reverse (22015130001), we get a palindrome (32018281023).

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

Divisors: 1 2 3 6 4649 9298 13947 27894 358613 717226 1075839 2151678 1667191837 3334383674 5001575511 10003151022