Base | Representation |
---|---|
bin | 10111101110000000010001… |
… | …110011010111001000011011 |
3 | 111200100120000202112111200120 |
4 | 113232000101303113020123 |
5 | 102133110104334041021 |
6 | 1005510153330204323 |
7 | 30654421142635326 |
oct | 2756002163271033 |
9 | 450316022474616 |
10 | 104316464362011 |
11 | 302694006759a0 |
12 | b849290a236a3 |
13 | 4629000ab1305 |
14 | 1ba8d2db817bd |
15 | c0d79d5a82c6 |
hex | 5ee011cd721b |
104316464362011 has 32 divisors (see below), whose sum is σ = 156966932056320. Its totient is φ = 61041358627200.
The previous prime is 104316464362003. The next prime is 104316464362063. The reversal of 104316464362011 is 110263464613401.
It is not a de Polignac number, because 104316464362011 - 23 = 104316464362003 is a prime.
It is a super-2 number, since 2×1043164643620112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104316464362111) 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, 94780581 + ... + 95874873.
It is an arithmetic number, because the mean of its divisors is an integer number (4905216626760).
Almost surely, 2104316464362011 is an apocalyptic number.
104316464362011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104316464362011 is a deficient number, since it is larger than the sum of its proper divisors (52650467694309).
104316464362011 is a wasteful number, since it uses less digits than its factorization.
104316464362011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1193947.
The product of its (nonzero) digits is 248832, while the sum is 42.
The spelling of 104316464362011 in words is "one hundred four trillion, three hundred sixteen billion, four hundred sixty-four million, three hundred sixty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •