Base | Representation |
---|---|
bin | 10011111000111101010… |
… | …110010001101110100000 |
3 | 11211200000122121210012201 |
4 | 103320331112101232200 |
5 | 134343231141200310 |
6 | 2523525033502544 |
7 | 200515202350111 |
oct | 23707526215640 |
9 | 4750018553181 |
10 | 1366828850080 |
11 | 48773a286401 |
12 | 1a0a98271a54 |
13 | 9bb78564a05 |
14 | 4a224d66208 |
15 | 2584ae35e3a |
hex | 13e3d591ba0 |
1366828850080 has 24 divisors (see below), whose sum is σ = 3229133158692. Its totient is φ = 546731539968.
The previous prime is 1366828850059. The next prime is 1366828850117. The reversal of 1366828850080 is 800588286631.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1366009287696 + 819562384 = 1168764^2 + 28628^2 .
It is a super-2 number, since 2×13668288500802 (a number of 25 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (55) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4271339997 + ... + 4271340316.
Almost surely, 21366828850080 is an apocalyptic number.
1366828850080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1366828850080 is an abundant number, since it is smaller than the sum of its proper divisors (1862304308612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1366828850080 is an equidigital number, since it uses as much as digits as its factorization.
1366828850080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8542680328 (or 8542680320 counting only the distinct ones).
The product of its (nonzero) digits is 4423680, while the sum is 55.
The spelling of 1366828850080 in words is "one trillion, three hundred sixty-six billion, eight hundred twenty-eight million, eight hundred fifty thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •