Search a number
-
+
101000011111002 = 23210752440296527
BaseRepresentation
bin10110111101101111100101…
…110010001101101001011010
3111020121111200102122110012100
4112331233211302031221122
5101214241010321023002
6554450433051224230
730163003300266003
oct2675574562155132
9436544612573170
10101000011111002
112a1aa956230a13
12b3b258b448076
13444834c801c33
141ad25d890c1aa
15ba2396ecd11c
hex5bdbe5c8da5a

101000011111002 has 24 divisors (see below), whose sum is σ = 220878528975936. Its totient is φ = 33352028590536.

The previous prime is 101000011110997. The next prime is 101000011111033. The reversal of 101000011111002 is 200111110000101.

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 11 ways as a sum of consecutive naturals, for example, 26220146338 + ... + 26220150189.

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

Almost surely, 2101000011111002 is an apocalyptic number.

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

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

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

101000011111002 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 101000011111002 its reverse (200111110000101), we get a palindrome (301111121111103).

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

Divisors: 1 2 3 6 9 18 107 214 321 642 963 1926 52440296527 104880593054 157320889581 314641779162 471962668743 943925337486 5611111728389 11222223456778 16833335185167 33666670370334 50500005555501 101000011111002