Base | Representation |
---|---|
bin | 1010101100100110001010… |
… | …0101001000111000000001 |
3 | 1112122100220102200001010001 |
4 | 2223021202211020320001 |
5 | 3020144042213444142 |
6 | 41003015503040001 |
7 | 2322503225363641 |
oct | 253114245107001 |
9 | 45570812601101 |
10 | 11761274359297 |
11 | 3824a2383a671 |
12 | 139b4b6ba0001 |
13 | 674111349418 |
14 | 2c936a698521 |
15 | 155e0ecdc5b7 |
hex | ab262948e01 |
11761274359297 has 32 divisors (see below), whose sum is σ = 12857859907200. Its totient is φ = 10719893818368.
The previous prime is 11761274359231. The next prime is 11761274359301. The reversal of 11761274359297 is 79295347216711.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11761274359297 is a prime.
It is a Smith number, since the sum of its digits (64) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (11761274359897) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 22313529 + ... + 22834537.
It is an arithmetic number, because the mean of its divisors is an integer number (401808122100).
Almost surely, 211761274359297 is an apocalyptic number.
It is an amenable number.
11761274359297 is a deficient number, since it is larger than the sum of its proper divisors (1096585547903).
11761274359297 is a wasteful number, since it uses less digits than its factorization.
11761274359297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 521425.
The product of its digits is 40007520, while the sum is 64.
The spelling of 11761274359297 in words is "eleven trillion, seven hundred sixty-one billion, two hundred seventy-four million, three hundred fifty-nine thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •