Base | Representation |
---|---|
bin | 10011111000010011000… |
… | …111011111101101101000 |
3 | 11211121012021102100022101 |
4 | 103320103013133231220 |
5 | 134340303301112021 |
6 | 2523330443503144 |
7 | 200461510141120 |
oct | 23702307375550 |
9 | 4747167370271 |
10 | 1366120332136 |
11 | 48740634938a |
12 | 1a091ab27ab4 |
13 | 9ba94832521 |
14 | 4a198c11c80 |
15 | 25808b2ea91 |
hex | 13e131dfb68 |
1366120332136 has 64 divisors (see below), whose sum is σ = 2943525530880. Its totient is φ = 582261765120.
The previous prime is 1366120332131. The next prime is 1366120332139. The reversal of 1366120332136 is 6312330216631.
It is a junction number, because it is equal to n+sod(n) for n = 1366120332095 and 1366120332104.
It is not an unprimeable number, because it can be changed into a prime (1366120332131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9959410 + ... + 10095646.
It is an arithmetic number, because the mean of its divisors is an integer number (45992586420).
Almost surely, 21366120332136 is an apocalyptic number.
It is an amenable number.
1366120332136 is an abundant number, since it is smaller than the sum of its proper divisors (1577405198744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1366120332136 is a wasteful number, since it uses less digits than its factorization.
1366120332136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137234 (or 137230 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 37.
Adding to 1366120332136 its reverse (6312330216631), we get a palindrome (7678450548767).
The spelling of 1366120332136 in words is "one trillion, three hundred sixty-six billion, one hundred twenty million, three hundred thirty-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •