Search a number
-
+
110000010011002 = 274933733989097
BaseRepresentation
bin11001000000101101011111…
…100001011010000101111010
3112102110220020211101101121221
4121000231133201122011322
5103404220010030323002
61025541150150222254
732112144535563256
oct3100553741320572
9472426224341557
10110000010011002
113205a818a58651
12104068a495498a
13494bc58398027
141d240593c9266
15cab54553dc37
hex640b5f85a17a

110000010011002 has 8 divisors (see below), whose sum is σ = 165002217208596. Its totient is φ = 54999270941472.

The previous prime is 110000010010967. The next prime is 110000010011069. The reversal of 110000010011002 is 200110010000011.

It can be written as a sum of positive squares in 2 ways, for example, as 99602216368281 + 10397793642721 = 9980091^2 + 3224561^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

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

It is an unprimeable number.

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

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

Almost surely, 2110000010011002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 734064032.

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

Adding to 110000010011002 its reverse (200110010000011), we get a palindrome (310110020011013).

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

Divisors: 1 2 74933 149866 733989097 1467978194 55000005005501 110000010011002