Search a number
-
+
13011010001 = 112377366529
BaseRepresentation
bin11000001111000010…
…00100000111010001
31020120202111210100022
430013201010013101
5203121304310001
65551023033225
7640265521523
oct140741040721
936522453308
1013011010001
115577415430
12263143b815
1312c47581b2
148b5dd3a13
155123c911b
hex3078441d1

13011010001 has 16 divisors (see below), whose sum is σ = 14830335360. Its totient is φ = 11299115520.

The previous prime is 13011009971. The next prime is 13011010039. The reversal of 13011010001 is 10001011031.

It is not a de Polignac number, because 13011010001 - 26 = 13011009937 is a prime.

It is a super-2 number, since 2×130110100012 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

Almost surely, 213011010001 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 67336.

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

Adding to 13011010001 its reverse (10001011031), we get a palindrome (23012021032).

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

Divisors: 1 11 23 253 773 8503 17779 66529 195569 731819 1530167 16831837 51426917 565696087 1182819091 13011010001