Search a number
-
+
101111010001002 = 2325617278333389
BaseRepresentation
bin10110111111010110111101…
…110101011000000001101010
3111021000010012010122022001100
4112333112331311120001222
5101223100322030013002
6555013431242502230
730204013041265131
oct2677267565300152
9437003163568040
10101111010001002
112a242a36206951
12b40bba8804976
13445595bc3a9c1
141ad7b28630918
15ba51e1b3811c
hex5bf5bdd5806a

101111010001002 has 12 divisors (see below), whose sum is σ = 219073855002210. Its totient is φ = 33703670000328.

The previous prime is 101111010000991. The next prime is 101111010001081. The reversal of 101111010001002 is 200100010111101.

It can be written as a sum of positive squares in only one way, i.e., 100917314069121 + 193695931881 = 10045761^2 + 440109^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2808639166677 + ... + 2808639166712.

Almost surely, 2101111010001002 is an apocalyptic number.

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

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

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

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

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

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

Adding to 101111010001002 its reverse (200100010111101), we get a palindrome (301211020112103).

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

Divisors: 1 2 3 6 9 18 5617278333389 11234556666778 16851835000167 33703670000334 50555505000501 101111010001002