Search a number
-
+
10101011013 = 331381270899
BaseRepresentation
bin10010110100001000…
…10011001001000101
3222001221211112012000
421122010103021011
5131141324323023
64350151415513
7505212114462
oct113204231105
928057745160
1010101011013
114313837095
121b5a984599
13c4c8c61c2
146bb738669
153e1bb2243
hex25a113245

10101011013 has 16 divisors (see below), whose sum is σ = 14975352000. Its totient is φ = 6729106320.

The previous prime is 10101011009. The next prime is 10101011029. The reversal of 10101011013 is 31011010101.

It is not a de Polignac number, because 10101011013 - 22 = 10101011009 is a prime.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 98163 + ... + 172736.

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

Almost surely, 210101011013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 10101011013 its reverse (31011010101), we get a palindrome (41112021114).

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

Divisors: 1 3 9 27 1381 4143 12429 37287 270899 812697 2438091 7314273 374111519 1122334557 3367003671 10101011013