Base | Representation |
---|---|
bin | 101010100111111000100… |
… | …0111011011100001011001 |
3 | 202202000202001201012111021 |
4 | 1111033301013123201121 |
5 | 1231434324413244431 |
6 | 20243100054402441 |
7 | 1143142552464463 |
oct | 125176107334131 |
9 | 22660661635437 |
10 | 5858085681241 |
11 | 19594447132a2 |
12 | 7a7405060421 |
13 | 336551cc2a11 |
14 | 16376624b133 |
15 | a25b017ab11 |
hex | 553f11db859 |
5858085681241 has 8 divisors (see below), whose sum is σ = 5891197201344. Its totient is φ = 5824982363760.
The previous prime is 5858085681223. The next prime is 5858085681263. The reversal of 5858085681241 is 1421865808585.
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 5858085681241 - 213 = 5858085673049 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5858085681241.
It is not an unprimeable number, because it can be changed into a prime (5858085681211) 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, 615445 + ... + 3477778.
It is an arithmetic number, because the mean of its divisors is an integer number (736399650168).
Almost surely, 25858085681241 is an apocalyptic number.
It is an amenable number.
5858085681241 is a deficient number, since it is larger than the sum of its proper divisors (33111520103).
5858085681241 is a wasteful number, since it uses less digits than its factorization.
5858085681241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4101311.
The product of its (nonzero) digits is 24576000, while the sum is 61.
The spelling of 5858085681241 in words is "five trillion, eight hundred fifty-eight billion, eighty-five million, six hundred eighty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •