Search a number
-
+
100013051222 = 2722477412007
BaseRepresentation
bin101110100100100111…
…1100000110101010110
3100120011002012102011022
41131021033200311112
53114311320114342
6113540110441142
710140262623500
oct1351117406526
9316132172138
10100013051222
113946283a737
12174722031b2
13957b42c066
144baaa9ad70
1529054669d2
hex17493e0d56

100013051222 has 24 divisors (see below), whose sum is σ = 174583445904. Its totient is φ = 42845327952.

The previous prime is 100013051207. The next prime is 100013051239. The reversal of 100013051222 is 222150310001.

It is a happy number.

It is a super-2 number, since 2×1000130512222 (a number of 23 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 100013051222.

It is a congruent number.

It is an unprimeable number.

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 11 ways as a sum of consecutive naturals, for example, 36743 + ... + 448749.

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

Almost surely, 2100013051222 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 120, while the sum is 17.

Adding to 100013051222 its reverse (222150310001), we get a palindrome (322163361223).

The spelling of 100013051222 in words is "one hundred billion, thirteen million, fifty-one thousand, two hundred twenty-two".

Divisors: 1 2 7 14 49 98 2477 4954 17339 34678 121373 242746 412007 824014 2884049 5768098 20188343 40376686 1020541339 2041082678 7143789373 14287578746 50006525611 100013051222