Search a number
-
+
101011110002 = 211337945571
BaseRepresentation
bin101111000010010111…
…0110011100001110010
3100122201122020001102022
41132010232303201302
53123332321010002
6114223122351442
710204102161035
oct1360456634162
9318648201368
10101011110002
1139925158000
12176b04bb582
1396aa13979a
144c6346101c
152962db2ba2
hex1784bb3872

101011110002 has 16 divisors (see below), whose sum is σ = 166656952224. Its totient is φ = 45914139700.

The previous prime is 101011110001. The next prime is 101011110007. The reversal of 101011110002 is 200011110101.

It is a happy number.

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

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

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

Almost surely, 2101011110002 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 8.

Adding to 101011110002 its reverse (200011110101), we get a palindrome (301022220103).

Subtracting 101011110002 from its reverse (200011110101), we obtain a palindrome (99000000099).

The spelling of 101011110002 in words is "one hundred one billion, eleven million, one hundred ten thousand, two".

Divisors: 1 2 11 22 121 242 1331 2662 37945571 75891142 417401281 834802562 4591414091 9182828182 50505555001 101011110002