Search a number
-
+
10101111010 = 2534728389
BaseRepresentation
bin10010110100001001…
…01011100011100010
3222001222000121100121
421122010223203202
5131141341023020
64350153510454
7505213012144
oct113204534342
928058017317
1010101111010
1143138a5231
121b5aa1242a
13c4c92c883
146bb762c94
153e1bd1baa
hex25a12b8e2

10101111010 has 24 divisors (see below), whose sum is σ = 18236722140. Its totient is φ = 4028320224.

The previous prime is 10101110993. The next prime is 10101111011. The reversal of 10101111010 is 1011110101.

It is a happy number.

It can be written as a sum of positive squares in 2 ways, for example, as 9917968921 + 183142089 = 99589^2 + 13533^2 .

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

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

Almost surely, 210101111010 is an apocalyptic number.

10101111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

10101111010 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 10101111010 its reverse (1011110101), we get a palindrome (11112221111).

Subtracting from 10101111010 its reverse (1011110101), we obtain a palindrome (9090000909).

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

Divisors: 1 2 5 10 347 694 1735 3470 8389 16778 41945 83890 120409 240818 602045 1204090 2910983 5821966 14554915 29109830 1010111101 2020222202 5050555505 10101111010