Base | Representation |
---|---|
bin | 10011110100010000010… |
… | …000000010010011000000 |
3 | 11211011222121012000211021 |
4 | 103310100100002103000 |
5 | 134302404440201000 |
6 | 2521331500555224 |
7 | 200246052553165 |
oct | 23642020022300 |
9 | 4734877160737 |
10 | 1361777272000 |
11 | 48558784aa92 |
12 | 19bb08552b14 |
13 | 9b551b17662 |
14 | 49ca60ba06c |
15 | 256526e211a |
hex | 13d104024c0 |
1361777272000 has 224 divisors, whose sum is σ = 3562170655680. Its totient is φ = 514263859200.
The previous prime is 1361777271991. The next prime is 1361777272001. The reversal of 1361777272000 is 2727771631.
It is not an unprimeable number, because it can be changed into a prime (1361777272001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44520712 + ... + 44551288.
It is an arithmetic number, because the mean of its divisors is an integer number (15902547570).
Almost surely, 21361777272000 is an apocalyptic number.
1361777272000 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 1361777272000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1781085327840).
1361777272000 is an abundant number, since it is smaller than the sum of its proper divisors (2200393383680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1361777272000 is a wasteful number, since it uses less digits than its factorization.
1361777272000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30916 (or 30896 counting only the distinct ones).
The product of its (nonzero) digits is 172872, while the sum is 43.
The spelling of 1361777272000 in words is "one trillion, three hundred sixty-one billion, seven hundred seventy-seven million, two hundred seventy-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •