Search a number
-
+
101011112001 = 3211223456889
BaseRepresentation
bin101111000010010111…
…0110100000001000001
3100122201122020011011100
41132010232310001001
53123332321041001
6114223122405013
710204102166622
oct1360456640101
9318648204140
10101011112001
1139925159558
12176b0500769
1396aa13a677
144c63461a49
152962db3586
hex1784bb4041

101011112001 has 6 divisors (see below), whose sum is σ = 145904939570. Its totient is φ = 67340741328.

The previous prime is 101011111991. The next prime is 101011112029. The reversal of 101011112001 is 100211110101.

It can be written as a sum of positive squares in only one way, i.e., 72390593025 + 28620518976 = 269055^2 + 169176^2 .

It is not a de Polignac number, because 101011112001 - 25 = 101011111969 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: 11223456889 = 101011112001 / (1 + 0 + 1 + 0 + 1 + 1 + 1 + 1 + 2 + 0 + 0 + 1).

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (101011112071) 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, 5611728436 + ... + 5611728453.

Almost surely, 2101011112001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 101011112001 its reverse (100211110101), we get a palindrome (201222222102).

The spelling of 101011112001 in words is "one hundred one billion, eleven million, one hundred twelve thousand, one".

Divisors: 1 3 9 11223456889 33670370667 101011112001