Base | Representation |
---|---|
bin | 110110100000111000… |
… | …100000011101101011 |
3 | 12121002022120012111210 |
4 | 312200320200131223 |
5 | 1424334114224233 |
6 | 42520125124203 |
7 | 4141343413221 |
oct | 664070403553 |
9 | 177068505453 |
10 | 58533742443 |
11 | 22907854060 |
12 | b4169b9663 |
13 | 569aa50477 |
14 | 2b93c54b11 |
15 | 17c8b71163 |
hex | da0e2076b |
58533742443 has 32 divisors (see below), whose sum is σ = 87487868160. Its totient is φ = 34497740160.
The previous prime is 58533742433. The next prime is 58533742451. The reversal of 58533742443 is 34424733585.
It is not a de Polignac number, because 58533742443 - 213 = 58533734251 is a prime.
It is a super-3 number, since 3×585337424433 (a number of 33 digits) contains 333 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 58533742392 and 58533742401.
It is not an unprimeable number, because it can be changed into a prime (58533742433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2465596 + ... + 2489222.
It is an arithmetic number, because the mean of its divisors is an integer number (2733995880).
Almost surely, 258533742443 is an apocalyptic number.
58533742443 is a deficient number, since it is larger than the sum of its proper divisors (28954125717).
58533742443 is a wasteful number, since it uses less digits than its factorization.
58533742443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25707.
The product of its digits is 4838400, while the sum is 48.
The spelling of 58533742443 in words is "fifty-eight billion, five hundred thirty-three million, seven hundred forty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •