Search a number
-
+
101110201123 = 23241104917389
BaseRepresentation
bin101111000101010100…
…0110011101100100011
3100122222112200101212211
41132022220303230203
53124033202413443
6114241022302551
710206414346321
oct1361250635443
9318875611784
10101110201123
1139976088698
1217719727a57
1396c4822699
144c72696d11
15296b93819d
hex178aa33b23

101110201123 has 16 divisors (see below), whose sum is σ = 106051176000. Its totient is φ = 96215454720.

The previous prime is 101110201117. The next prime is 101110201151. The reversal of 101110201123 is 321102011101.

It is a happy number.

It is a de Polignac number, because none of the positive numbers 2k-101110201123 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2101110201123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 18702.

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

Adding to 101110201123 its reverse (321102011101), we get a palindrome (422212212224).

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

Divisors: 1 23 241 1049 5543 17389 24127 252809 399947 4190749 5814607 18241061 96387227 419544403 4396095701 101110201123