Base | Representation |
---|---|
bin | 10111100000101110110110… |
… | …100100110111111001101111 |
3 | 111120010100211110222111011222 |
4 | 113200232312210313321233 |
5 | 102023134203044130141 |
6 | 1003531154222133555 |
7 | 30531502306215500 |
oct | 2740566644677157 |
9 | 446110743874158 |
10 | 103404400770671 |
11 | 2aa47618540400 |
12 | b7205707212bb |
13 | 4590cbac56ba0 |
14 | 1b76b2a546ba7 |
15 | be4bbbe4914b |
hex | 5e0bb6937e6f |
103404400770671 has 36 divisors (see below), whose sum is σ = 142386479489016. Its totient is φ = 74376791707680.
The previous prime is 103404400770667. The next prime is 103404400770791. The reversal of 103404400770671 is 176077004404301.
It is not a de Polignac number, because 103404400770671 - 22 = 103404400770667 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103404400770631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 670709285 + ... + 670863438.
It is an arithmetic number, because the mean of its divisors is an integer number (3955179985806).
Almost surely, 2103404400770671 is an apocalyptic number.
103404400770671 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103404400770671 is a deficient number, since it is larger than the sum of its proper divisors (38982078718345).
103404400770671 is a wasteful number, since it uses less digits than its factorization.
103404400770671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341572772 (or 1341572754 counting only the distinct ones).
The product of its (nonzero) digits is 395136, while the sum is 44.
The spelling of 103404400770671 in words is "one hundred three trillion, four hundred four billion, four hundred million, seven hundred seventy thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •