Base | Representation |
---|---|
bin | 10011100010000011010… |
… | …00100100001110001101 |
3 | 2101011021020020202222200 |
4 | 21301001220210032031 |
5 | 41443421202120331 |
6 | 1232150110032113 |
7 | 66325611212451 |
oct | 11610150441615 |
9 | 2334236222880 |
10 | 671116051341 |
11 | 23968957354a |
12 | aa0974a8639 |
13 | 4b394385868 |
14 | 246a71b6661 |
15 | 126cd4355e6 |
hex | 9c41a2438d |
671116051341 has 48 divisors (see below), whose sum is σ = 1037902320000. Its totient is φ = 416607131520.
The previous prime is 671116051253. The next prime is 671116051343. The reversal of 671116051341 is 143150611176.
It is a happy number.
671116051341 is a `hidden beast` number, since 6 + 7 + 1 + 1 + 1 + 605 + 1 + 3 + 41 = 666.
It is not a de Polignac number, because 671116051341 - 27 = 671116051213 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 671116051296 and 671116051305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (671116051343) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14569975 + ... + 14615963.
It is an arithmetic number, because the mean of its divisors is an integer number (21622965000).
Almost surely, 2671116051341 is an apocalyptic number.
671116051341 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
It is an amenable number.
671116051341 is a deficient number, since it is larger than the sum of its proper divisors (366786268659).
671116051341 is a wasteful number, since it uses less digits than its factorization.
671116051341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47474 (or 47471 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The spelling of 671116051341 in words is "six hundred seventy-one billion, one hundred sixteen million, fifty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •