Base | Representation |
---|---|
bin | 10010111010110001111… |
… | …111011001111011011000 |
3 | 11121021200212010110001022 |
4 | 102322301333121323120 |
5 | 132300013433440041 |
6 | 2433124152542012 |
7 | 162632566214462 |
oct | 22726177317330 |
9 | 4537625113038 |
10 | 1300066311896 |
11 | 46139a5a4310 |
12 | 18bb656b1908 |
13 | 95798a74351 |
14 | 46cd02cb132 |
15 | 23c3eb7324b |
hex | 12eb1fd9ed8 |
1300066311896 has 64 divisors (see below), whose sum is σ = 2751925428000. Its totient is φ = 570354319360.
The previous prime is 1300066311893. The next prime is 1300066311931. The reversal of 1300066311896 is 6981136600031.
It is a super-2 number, since 2×13000663118962 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300066311893) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7026200 + ... + 7208856.
Almost surely, 21300066311896 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1300066311896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1375962714000).
1300066311896 is an abundant number, since it is smaller than the sum of its proper divisors (1451859116104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300066311896 is a wasteful number, since it uses less digits than its factorization.
1300066311896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185492 (or 185488 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 44.
The spelling of 1300066311896 in words is "one trillion, three hundred billion, sixty-six million, three hundred eleven thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •