Cookie Consent by FreePrivacyPolicy.com
Search a number
110010011011211 = 2936849110294549
BaseRepresentation
bin11001000000110110110011…
…101000001100100010001011
3112102111212001211000211210002
4121000312303220030202023
5103404401000304324321
61025545522410313215
732112650424642263
oct3100666350144213
9472455054024702
10110010011011211
1132063a90296083
121040881612880b
13494cb9034582c
141d2472772c7a3
15cab92d54820b
hex640db3a0c88b

110010011011211 has 8 divisors (see below), whose sum is σ = 113803779558000. Its totient is φ = 106216263790560.

The previous prime is 110010011011183. The next prime is 110010011011231. The reversal of 110010011011211 is 112110110010011.

It is a happy number.

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

It is a cyclic number.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (110010011011231) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5538965 + ... + 15833513.

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

Almost surely, 2110010011011211 is an apocalyptic number.

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

110010011011211 is a wasteful number, since it uses less digits than its factorization.

110010011011211 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10663069.

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

Adding to 110010011011211 its reverse (112110110010011), we get a palindrome (222120121021222).

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