Search a number
-
+
110111101001010 = 232537614435472237
BaseRepresentation
bin11001000010010100111101…
…000011111001110100110010
3112102212111222221200101221100
4121002110331003321310302
5103413030013324013020
61030104201431505230
732123156505452514
oct3102247503716462
9472774887611840
10110111101001010
11320a2945a1969a
1210424328b28216
13495958090c845
141d29597443bb4
15cae3982dca90
hex64253d0f9d32

110111101001010 has 384 divisors, whose sum is σ = 300202810861824. Its totient is φ = 27973815367680.

The previous prime is 110111101001003. The next prime is 110111101001053. The reversal of 110111101001010 is 10100101111011.

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

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

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 191 ways as a sum of consecutive naturals, for example, 49222663612 + ... + 49222665848.

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

Almost surely, 2110111101001010 is an apocalyptic number.

110111101001010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is a practical number, because each smaller number is the sum of distinct divisors of 110111101001010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150101405430912).

110111101001010 is an abundant number, since it is smaller than the sum of its proper divisors (190091709860814).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 110111101001010 its reverse (10100101111011), we get a palindrome (120211202112021).

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