Search a number
BaseRepresentation
bin11101011011001001110…
…01000111101111110101
310120122121000200212222221
432231210321013233311
5113031022030310401
62052241313122341
7133020525202600
oct16554471075765
93518530625887
101011010010101
1135a8488804a3
12143b352593b1
13744512b9510
1436d0c7a1337
151b4731317a1
hexeb64e47bf5

1011010010101 has 12 divisors (see below), whose sum is σ = 1266540013452. Its totient is φ = 799920007488.

The previous prime is 1011010010099. The next prime is 1011010010111. The reversal of 1011010010101 is 1010100101101.

Adding to 1011010010101 its reverse (1010100101101), we get a palindrome (2021110111202).

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 441694489201 + 569315520900 = 664601^2 + 754530^2 .

It is not a de Polignac number, because 1011010010101 - 21 = 1011010010099 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21011010010101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1, while the sum is 7.

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