Search a number
-
+
11012100002 = 25506050001
BaseRepresentation
bin10100100000101111…
…10100111110100010
31001102110012122022122
422100113310332202
5140023044200002
65020415304242
7536614206551
oct122027647642
931373178278
1011012100002
1147410527a2
122173b1b082
1310665a3007
1476673dd98
15446b7e6a2
hex2905f4fa2

11012100002 has 4 divisors (see below), whose sum is σ = 16518150006. Its totient is φ = 5506050000.

The previous prime is 11012099981. The next prime is 11012100041. The reversal of 11012100002 is 20000121011.

11012100002 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 20000121011 = 131538470847.

It can be written as a sum of positive squares in only one way, i.e., 6624494881 + 4387605121 = 81391^2 + 66239^2 .

It is an unprimeable number.

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 as a sum of consecutive naturals, namely, 2753024999 + ... + 2753025002.

Almost surely, 211012100002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5506050003.

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

Adding to 11012100002 its reverse (20000121011), we get a palindrome (31012221013).

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

Divisors: 1 2 5506050001 11012100002