Search a number
-
+
10101001001013 = 3213809106716121
BaseRepresentation
bin1001001011111101001010…
…0100111001100000110101
31022202122110010102201022200
42102333102210321200311
52310443322224013023
633252200311015113
72061526135603146
oct222772244714065
938678403381280
1010101001001013
1132448a0806a8a
12117178496a499
1358369c165950
1426cc690bbacd
15127b3beaa743
hex92fd2939835

10101001001013 has 24 divisors (see below), whose sum is σ = 15732090705240. Its totient is φ = 6208316997120.

The previous prime is 10101001001011. The next prime is 10101001001017. The reversal of 10101001001013 is 31010010010101.

10101001001013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 1070393021604 + 9030607979409 = 1034598^2 + 3005097^2 .

It is not a de Polignac number, because 10101001001013 - 21 = 10101001001011 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 = 10101001000986 and 10101001001004.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 53263408 + ... + 53452713.

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

Almost surely, 210101001001013 is an apocalyptic number.

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

It is an amenable number.

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

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

10101001001013 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 10101001001013 its reverse (31010010010101), we get a palindrome (41111011011114).

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

Divisors: 1 3 9 13 39 117 809 2427 7281 10517 31551 94653 106716121 320148363 960445089 1387309573 4161928719 12485786157 86333341889 259000025667 777000077001 1122333444557 3367000333671 10101001001013