Base | Representation |
---|---|
bin | 10011000100111110011… |
… | …110001000000011110000 |
3 | 11122022221202110102000010 |
4 | 103010332132020003300 |
5 | 132434423324010000 |
6 | 2442134320454520 |
7 | 163501061365656 |
oct | 23047636100360 |
9 | 4568852412003 |
10 | 1311013110000 |
11 | 465aa77a47a0 |
12 | 1920bb77a440 |
13 | 96821962089 |
14 | 4764c0acdd6 |
15 | 24180c03d50 |
hex | 1313e7880f0 |
1311013110000 has 800 divisors, whose sum is σ = 5071712532480. Its totient is φ = 287971200000.
The previous prime is 1311013109993. The next prime is 1311013110013. The reversal of 1311013110000 is 113101131.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 144205455 + ... + 144214545.
Almost surely, 21311013110000 is an apocalyptic number.
1311013110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1311013110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2535856266240).
1311013110000 is an abundant number, since it is smaller than the sum of its proper divisors (3760699422480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1311013110000 is a wasteful number, since it uses less digits than its factorization.
1311013110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9175 (or 9154 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 1311013110000 its reverse (113101131), we get a palindrome (1311126211131).
The spelling of 1311013110000 in words is "one trillion, three hundred eleven billion, thirteen million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •