Search a number
-
+
101013110001 = 3211223678889
BaseRepresentation
bin101111000010011011…
…0011011110011110001
3100122201202222122220100
41132010312123303301
53123333324010001
6114223233303013
710204125160656
oct1360466336361
9318652878810
10101013110001
11399262a36a1
12176b1104a69
1396aa689c0b
144c63821c2d
15296315a586
hex1784d9bcf1

101013110001 has 6 divisors (see below), whose sum is σ = 145907825570. Its totient is φ = 67342073328.

The previous prime is 101013109993. The next prime is 101013110017. The reversal of 101013110001 is 100011310101.

It can be written as a sum of positive squares in only one way, i.e., 55189285776 + 45823824225 = 234924^2 + 214065^2 .

It is not a de Polignac number, because 101013110001 - 23 = 101013109993 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11223678889 = 101013110001 / (1 + 0 + 1 + 0 + 1 + 3 + 1 + 1 + 0 + 0 + 0 + 1).

It is a Duffinian number.

It is a Curzon number.

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

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

Almost surely, 2101013110001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 101013110001 its reverse (100011310101), we get a palindrome (201024420102).

The spelling of 101013110001 in words is "one hundred one billion, thirteen million, one hundred ten thousand, one".

Divisors: 1 3 9 11223678889 33671036667 101013110001