Search a number
-
+
110101001001000 = 2335336700333667
BaseRepresentation
bin11001000010001011100011…
…000011011101100000101000
3112102211112221001202020120220
4121002023203003131200220
5103412343322224013000
61030055411313450040
732122351305045402
oct3102134303354050
9472745831666526
10110101001001000
1132099632813149
121042238a570920
1349586312ab889
141d28cb9ccdb72
15cadea677a1a0
hex6422e30dd828

110101001001000 has 64 divisors (see below), whose sum is σ = 343515123132480. Its totient is φ = 29360266932800.

The previous prime is 110101001000957. The next prime is 110101001001007. The reversal of 110101001001000 is 100100101011.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a self number, because there is not a number n which added to its sum of digits gives 110101001001000.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18350163834 + ... + 18350169833.

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

Almost surely, 2110101001001000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

Adding to 110101001001000 its reverse (100100101011), we get a palindrome (110201101102011).

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

Divisors: 1 2 3 4 5 6 8 10 12 15 20 24 25 30 40 50 60 75 100 120 125 150 200 250 300 375 500 600 750 1000 1500 3000 36700333667 73400667334 110101001001 146801334668 183501668335 220202002002 293602669336 367003336670 440404004004 550505005005 734006673340 880808008008 917508341675 1101010010010 1468013346680 1835016683350 2202020020020 2752525025025 3670033366700 4404040040040 4587541708375 5505050050050 7340066733400 9175083416750 11010100100100 13762625125125 18350166833500 22020200200200 27525250250250 36700333667000 55050500500500 110101001001000