Base | Representation |
---|---|
bin | 101110010010011111010110… |
… | …0100001011010000011010001 |
3 | 1222101122020222221100001011121 |
4 | 1130210332230201122003101 |
5 | 411331413222234211423 |
6 | 4001543224355242241 |
7 | 151522306341110365 |
oct | 13444765441320321 |
9 | 1871566887301147 |
10 | 407161499132113 |
11 | 108809249644260 |
12 | 397ba7622a9381 |
13 | 1462621a8901cb |
14 | 7278a1650d2a5 |
15 | 3211311be245d |
hex | 1724fac85a0d1 |
407161499132113 has 8 divisors (see below), whose sum is σ = 444190234345920. Its totient is φ = 370135106164080.
The previous prime is 407161499132099. The next prime is 407161499132183. The reversal of 407161499132113 is 311231994161704.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 407161499132113 - 213 = 407161499123921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (407161499132183) 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 7 ways as a sum of consecutive naturals, for example, 585197958 + ... + 585893311.
It is an arithmetic number, because the mean of its divisors is an integer number (55523779293240).
Almost surely, 2407161499132113 is an apocalyptic number.
It is an amenable number.
407161499132113 is a deficient number, since it is larger than the sum of its proper divisors (37028735213807).
407161499132113 is a wasteful number, since it uses less digits than its factorization.
407161499132113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1171122887.
The product of its (nonzero) digits is 979776, while the sum is 52.
The spelling of 407161499132113 in words is "four hundred seven trillion, one hundred sixty-one billion, four hundred ninety-nine million, one hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •