Search a number
-
+
10101015151 = 101100010051
BaseRepresentation
bin10010110100001000…
…10100001001101111
3222001221211201212021
421122010110021233
5131141324441101
64350151451011
7505212132523
oct113204241157
928057751767
1010101015151
11431383a207
121b5a986a67
13c4c8c8056
146bb739d83
153e1bb35a1
hex25a11426f

10101015151 has 4 divisors (see below), whose sum is σ = 10201025304. Its totient is φ = 10001005000.

The previous prime is 10101015131. The next prime is 10101015161. The reversal of 10101015151 is 15151010101.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15151010101 = 101150010001.

It is a cyclic number.

It is not a de Polignac number, because 10101015151 - 211 = 10101013103 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50004925 + ... + 50005126.

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

Almost surely, 210101015151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 100010152.

The product of its (nonzero) digits is 25, while the sum is 16.

Adding to 10101015151 its reverse (15151010101), we get a palindrome (25252025252).

The spelling of 10101015151 in words is "ten billion, one hundred one million, fifteen thousand, one hundred fifty-one".

Divisors: 1 101 100010051 10101015151