Search a number
-
+
110100010101000 = 23353306111989547
BaseRepresentation
bin11001000010001010100111…
…111111011110100100001000
3112102211110101000012022022220
4121002022213333132210020
5103412334310041213000
61030055125115214040
732122314613405203
oct3102124777364410
9472743330168286
10110100010101000
1132099174445327
1210422152747320
134958503c0970a
141d28c2447093a
15cade497951a0
hex6422a7fde908

110100010101000 has 128 divisors (see below), whose sum is σ = 343624282335360. Its totient is φ = 29350408608000.

The previous prime is 110100010100957. The next prime is 110100010101121. The reversal of 110100010101000 is 101010001011.

110100010101000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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 110100010101000.

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 31 ways as a sum of consecutive naturals, for example, 3188227 + ... + 15177773.

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

Almost surely, 2110100010101000 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 110100010101000 its reverse (101010001011), we get a palindrome (110201020102011).

The spelling of 110100010101000 in words is "one hundred ten trillion, one hundred billion, ten million, one hundred 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 3061 6122 9183 12244 15305 18366 24488 30610 36732 45915 61220 73464 76525 91830 122440 153050 183660 229575 306100 367320 382625 459150 612200 765250 918300 1147875 1530500 1836600 2295750 3061000 4591500 9183000 11989547 23979094 35968641 47958188 59947735 71937282 95916376 119895470 143874564 179843205 239790940 287749128 299738675 359686410 479581880 599477350 719372820 899216025 1198954700 1438745640 1498693375 1798432050 2397909400 2997386750 3596864100 4496080125 5994773500 7193728200 8992160250 11989547000 17984320500 35968641000 36700003367 73400006734 110100010101 146800013468 183500016835 220200020202 293600026936 367000033670 440400040404 550500050505 734000067340 880800080808 917500084175 1101000101010 1468000134680 1835000168350 2202000202020 2752500252525 3670000336700 4404000404040 4587500420875 5505000505050 7340000673400 9175000841750 11010001010100 13762501262625 18350001683500 22020002020200 27525002525250 36700003367000 55050005050500 110100010101000