Base | Representation |
---|---|
bin | 110110011001001011… |
… | …010010010001001111 |
3 | 12120202022021022221012 |
4 | 312121023102101033 |
5 | 1424103014303221 |
6 | 42455225555435 |
7 | 4135213416410 |
oct | 663113222117 |
9 | 176668238835 |
10 | 58404447311 |
11 | 22850873781 |
12 | b39b645b7b |
13 | 567a020782 |
14 | 2b809d9807 |
15 | 17bc63165b |
hex | d992d244f |
58404447311 has 8 divisors (see below), whose sum is σ = 69049593120. Its totient is φ = 48334714848.
The previous prime is 58404447281. The next prime is 58404447313. The reversal of 58404447311 is 11374440485.
58404447311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 58404447311 - 234 = 41224578127 is a prime.
It is a super-2 number, since 2×584044473112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58404447313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143853116 + ... + 143853521.
It is an arithmetic number, because the mean of its divisors is an integer number (8631199140).
Almost surely, 258404447311 is an apocalyptic number.
58404447311 is a deficient number, since it is larger than the sum of its proper divisors (10645145809).
58404447311 is a wasteful number, since it uses less digits than its factorization.
58404447311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 287706673.
The product of its (nonzero) digits is 215040, while the sum is 41.
Adding to 58404447311 its reverse (11374440485), we get a palindrome (69778887796).
The spelling of 58404447311 in words is "fifty-eight billion, four hundred four million, four hundred forty-seven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •