Search a number
-
+
100002011211 = 341234592731
BaseRepresentation
bin101110100100010010…
…1011001100001001011
3100120010022102112010000
41131020211121201023
53114301003324321
6113535034054043
710140100033044
oct1351045314113
9316108375100
10100002011211
113945758a163
121746a57a323
139579064ccb
144ba94258cb
1529044d5826
hex174895984b

100002011211 has 10 divisors (see below), whose sum is σ = 149385720572. Its totient is φ = 66668007420.

The previous prime is 100002011209. The next prime is 100002011227. The reversal of 100002011211 is 112110200001.

It is a happy number.

It is not a de Polignac number, because 100002011211 - 21 = 100002011209 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2100002011211 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 100002011211 its reverse (112110200001), we get a palindrome (212112211212).

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

Divisors: 1 3 9 27 81 1234592731 3703778193 11111334579 33334003737 100002011211