Search a number
-
+
101100011013 = 3285913077223
BaseRepresentation
bin101111000101000000…
…1111011111000000101
3100122221211111200200100
41132022001323320011
53124023100323023
6114240020034313
710206231625461
oct1361201737005
9318854450610
10101100011013
1139970358711
1217716232999
1396c2695431
144c711a34a1
15296aac3c43
hex178a07be05

101100011013 has 12 divisors (see below), whose sum is σ = 146203364320. Its totient is φ = 67321538856.

The previous prime is 101100011011. The next prime is 101100011017. The reversal of 101100011013 is 310110001101.

It is not a de Polignac number, because 101100011013 - 21 = 101100011011 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6530881 + ... + 6546342.

Almost surely, 2101100011013 is an apocalyptic number.

It is an amenable number.

101100011013 is a deficient number, since it is larger than the sum of its proper divisors (45103353307).

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

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

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

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

Adding to 101100011013 its reverse (310110001101), we get a palindrome (411210012114).

It can be divided in two parts, 10110001101 and 3, that multiplied together give a palindrome (30330003303).

The spelling of 101100011013 in words is "one hundred one billion, one hundred million, eleven thousand, thirteen".

Divisors: 1 3 9 859 2577 7731 13077223 39231669 117695007 11233334557 33700003671 101100011013