Base | Representation |
---|---|
bin | 10100000010101100000… |
… | …111000100101001001000 |
3 | 11212122222210210100100000 |
4 | 110002230013010221020 |
5 | 140031130412214041 |
6 | 2532413511243000 |
7 | 201335131635300 |
oct | 24025407045110 |
9 | 4778883710300 |
10 | 1377277069896 |
11 | 491111000612 |
12 | 1a2b13379460 |
13 | 9cb520777c0 |
14 | 4a936842600 |
15 | 25c5d32ebb6 |
hex | 140ac1c4a48 |
1377277069896 has 576 divisors, whose sum is σ = 4964352382080. Its totient is φ = 354365383680.
The previous prime is 1377277069849. The next prime is 1377277069901. The reversal of 1377277069896 is 6989607727731.
It is a super-2 number, since 2×13772770698962 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 50757885 + ... + 50785011.
It is an arithmetic number, because the mean of its divisors is an integer number (8618667330).
Almost surely, 21377277069896 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 1377277069896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2482176191040).
1377277069896 is an abundant number, since it is smaller than the sum of its proper divisors (3587075312184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1377277069896 is a wasteful number, since it uses less digits than its factorization.
1377277069896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27216 (or 27193 counting only the distinct ones).
The product of its (nonzero) digits is 336063168, while the sum is 72.
The spelling of 1377277069896 in words is "one trillion, three hundred seventy-seven billion, two hundred seventy-seven million, sixty-nine thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •