Search a number
-
+
110121101111002 = 2369714893305533
BaseRepresentation
bin11001000010011110010001…
…000111010010111011011010
3112102220110210212122121221111
4121002132101013102323122
5103413211003341023002
61030112534020530534
732123662354133242
oct3102362107227332
9472813725577844
10110121101111002
11320a71077a9303
1210426259b50a4a
13495a4b56380a7
141d29c655d4b22
15cae7811bd3d7
hex6427911d2eda

110121101111002 has 8 divisors (see below), whose sum is σ = 165226331594196. Its totient is φ = 55045657246272.

The previous prime is 110121101110997. The next prime is 110121101111041. The reversal of 110121101111002 is 200111101121011.

It can be written as a sum of positive squares in 2 ways, for example, as 109761054309481 + 360046801521 = 10476691^2 + 600039^2 .

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

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, 7446645373 + ... + 7446660160.

Almost surely, 2110121101111002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14893309232.

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

Adding to 110121101111002 its reverse (200111101121011), we get a palindrome (310232202232013).

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

Divisors: 1 2 3697 7394 14893305533 29786611066 55060550555501 110121101111002