Search a number
-
+
10110102201122 = 271165650014293
BaseRepresentation
bin1001001100011111000100…
…0011001110001100100010
31022210111221101221120210012
42103013301003032030202
52311120442130413442
633300303345204522
72062300520535230
oct223076103161442
938714841846705
1010110102201122
113248741139370
1211734a4930742
135844bc889a61
1426d48db17950
15127ec0ec7582
hex931f10ce322

10110102201122 has 16 divisors (see below), whose sum is σ = 18907204116672. Its totient is φ = 3939000857520.

The previous prime is 10110102201109. The next prime is 10110102201187. The reversal of 10110102201122 is 22110220101101.

It is a Harshad number since it is a multiple of its sum of digits (14).

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

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

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

Almost surely, 210110102201122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 65650014313.

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

Adding to 10110102201122 its reverse (22110220101101), we get a palindrome (32220322302223).

The spelling of 10110102201122 in words is "ten trillion, one hundred ten billion, one hundred two million, two hundred one thousand, one hundred twenty-two".

Divisors: 1 2 7 11 14 22 77 154 65650014293 131300028586 459550100051 722150157223 919100200102 1444300314446 5055051100561 10110102201122