Search a number
-
+
101002111123 = 255739500239
BaseRepresentation
bin101111000010000110…
…0011110100010010011
3100122201000021212021111
41132010030132202103
53123323020023443
6114222201434151
710203632531164
oct1360414364223
9318630255244
10101002111123
1139920071011
12176a949b957
1396a83087c4
144c6219b76b
1529621d669d
hex178431e893

101002111123 has 4 divisors (see below), whose sum is σ = 101041613920. Its totient is φ = 100962608328.

The previous prime is 101002111117. The next prime is 101002111159. The reversal of 101002111123 is 321111200101.

It is a happy number.

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

It is a cyclic number.

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

It is a super-2 number, since 2×1010021111232 (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 (101002111423) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19747563 + ... + 19752676.

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

Almost surely, 2101002111123 is an apocalyptic number.

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

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

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

The sum of its prime factors is 39502796.

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

Adding to 101002111123 its reverse (321111200101), we get a palindrome (422113311224).

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

Divisors: 1 2557 39500239 101002111123