Search a number
BaseRepresentation
bin11000010100010001…
…11010100111101110
31020200211022021210102
430022020322213232
5203214040330220
65555234111102
7641341523315
oct141210724756
936624267712
1013055011310
11559a239250
12264411b492
1313008c3083
148bbba927c
155161bb775
hex30a23a9ee

13055011310 has 64 divisors (see below), whose sum is σ = 26294575104. Its totient is φ = 4625491200.

The previous prime is 13055011279. The next prime is 13055011313. The reversal of 13055011310 is 1311055031.

Adding to 13055011310 its reverse (1311055031), we get a palindrome (14366066341).

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

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4901039 + ... + 4903701.

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

Almost surely, 213055011310 is an apocalyptic number.

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

13055011310 is an abundant number, since it is smaller than the sum of its proper divisors (13239563794).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 3809.

The product of its (nonzero) digits is 225, while the sum is 20.

The spelling of 13055011310 in words is "thirteen billion, fifty-five million, eleven thousand, three hundred ten".