Base | Representation |
---|---|
bin | 10011000101000011101… |
… | …101011100000110000110 |
3 | 11122100011212212012120011 |
4 | 103011003231130012012 |
5 | 132440113324312220 |
6 | 2442151140500434 |
7 | 163503206465050 |
oct | 23050355340606 |
9 | 4570155765504 |
10 | 1311101010310 |
11 | 466042381583 |
12 | 1921250aa71a |
13 | 96836c2a3b0 |
14 | 47659a308d0 |
15 | 241887b865a |
hex | 13143b5c186 |
1311101010310 has 128 divisors (see below), whose sum is σ = 2981850246144. Its totient is φ = 403968176640.
The previous prime is 1311101010277. The next prime is 1311101010311. The reversal of 1311101010310 is 130101011131.
It is a super-2 number, since 2×13111010103102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311101010311) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 11958340 + ... + 12067480.
It is an arithmetic number, because the mean of its divisors is an integer number (23295705048).
Almost surely, 21311101010310 is an apocalyptic number.
1311101010310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1311101010310 is an abundant number, since it is smaller than the sum of its proper divisors (1670749235834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311101010310 is a wasteful number, since it uses less digits than its factorization.
1311101010310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109518.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 1311101010310 its reverse (130101011131), we get a palindrome (1441202021441).
The spelling of 1311101010310 in words is "one trillion, three hundred eleven billion, one hundred one million, ten thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •