Base | Representation |
---|---|
bin | 10011001101111010001… |
… | …111001110110001000111 |
3 | 11200020201021202011122011 |
4 | 103031322033032301013 |
5 | 133114100034212441 |
6 | 2450402232515051 |
7 | 164260561600060 |
oct | 23157217166107 |
9 | 4606637664564 |
10 | 1320605772871 |
11 | 46a07a592350 |
12 | 193b3824ba87 |
13 | 976c013c458 |
14 | 47cbc0bb567 |
15 | 24542e4e581 |
hex | 1337a3cec47 |
1320605772871 has 32 divisors (see below), whose sum is σ = 1712655060480. Its totient is φ = 988069622400.
The previous prime is 1320605772869. The next prime is 1320605772883. The reversal of 1320605772871 is 1782775060231.
It is a happy number.
It is not a de Polignac number, because 1320605772871 - 21 = 1320605772869 is a prime.
It is a super-2 number, since 2×13206057728712 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320605772821) 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 31 ways as a sum of consecutive naturals, for example, 1229541 + ... + 2037886.
It is an arithmetic number, because the mean of its divisors is an integer number (53520470640).
Almost surely, 21320605772871 is an apocalyptic number.
1320605772871 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1320605772871 is a deficient number, since it is larger than the sum of its proper divisors (392049287609).
1320605772871 is a wasteful number, since it uses less digits than its factorization.
1320605772871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3267655.
The product of its (nonzero) digits is 987840, while the sum is 49.
The spelling of 1320605772871 in words is "one trillion, three hundred twenty billion, six hundred five million, seven hundred seventy-two thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •