Search a number
-
+
10111201123 = 57149176927
BaseRepresentation
bin10010110101010110…
…01010111101100011
3222002200000020101111
421122223022331203
5131201431413443
64351154044151
7505364535322
oct113253127543
928080006344
1010111201123
114319567071
121b62279657
13c51a5345a
146bcc2c0b9
153e2a2669d
hex25aacaf63

10111201123 has 4 divisors (see below), whose sum is σ = 10111435200. Its totient is φ = 10110967048.

The previous prime is 10111201069. The next prime is 10111201153. The reversal of 10111201123 is 32110211101.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10111201123 - 217 = 10111070051 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10111201153) 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, 31315 + ... + 145612.

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

Almost surely, 210111201123 is an apocalyptic number.

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

10111201123 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 234076.

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

Adding to 10111201123 its reverse (32110211101), we get a palindrome (42221412224).

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

Divisors: 1 57149 176927 10111201123