Base | Representation |
---|---|
bin | 10111111000100011011011… |
… | …110101101000101000000101 |
3 | 111202220212020100202102220100 |
4 | 113320203123311220220011 |
5 | 102231444301031230232 |
6 | 1011223205030154313 |
7 | 31060664011051416 |
oct | 2770433365505005 |
9 | 452825210672810 |
10 | 105041408461317 |
11 | 305188a171a599 |
12 | b94588b1b2999 |
13 | 467c493011613 |
14 | 1bd2061c3b80d |
15 | c2257c48ec7c |
hex | 5f88dbd68a05 |
105041408461317 has 48 divisors (see below), whose sum is σ = 156101017093632. Its totient is φ = 68015336601600.
The previous prime is 105041408461313. The next prime is 105041408461349. The reversal of 105041408461317 is 713164804140501.
105041408461317 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 4 + 14 + 0 + 8 + 4 + 613 + 17 = 666.
It is not a de Polignac number, because 105041408461317 - 22 = 105041408461313 is a prime.
It is a super-2 number, since 2×1050414084613172 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105041408461313) 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, 472777908 + ... + 473000034.
It is an arithmetic number, because the mean of its divisors is an integer number (3252104522784).
Almost surely, 2105041408461317 is an apocalyptic number.
It is an amenable number.
105041408461317 is a deficient number, since it is larger than the sum of its proper divisors (51059608632315).
105041408461317 is a wasteful number, since it uses less digits than its factorization.
105041408461317 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 224658 (or 224655 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 45.
The spelling of 105041408461317 in words is "one hundred five trillion, forty-one billion, four hundred eight million, four hundred sixty-one thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •