Base | Representation |
---|---|
bin | 110110000011011101… |
… | …100100110100000111 |
3 | 12112210220202202112001 |
4 | 312003131210310013 |
5 | 1422331234034421 |
6 | 42355133410131 |
7 | 4123201035136 |
oct | 660335446407 |
9 | 175726682461 |
10 | 58040143111 |
11 | 22684169625 |
12 | b2b9639947 |
13 | 561c6c9862 |
14 | 2b4848791d |
15 | 179a66e691 |
hex | d83764d07 |
58040143111 has 8 divisors (see below), whose sum is σ = 59996931200. Its totient is φ = 56088637920.
The previous prime is 58040143039. The next prime is 58040143141. The reversal of 58040143111 is 11134104085.
58040143111 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 a cyclic number.
It is not a de Polignac number, because 58040143111 - 219 = 58039618823 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 58040143111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58040143141) 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, 1298376 + ... + 1342333.
It is an arithmetic number, because the mean of its divisors is an integer number (7499616400).
Almost surely, 258040143111 is an apocalyptic number.
58040143111 is a deficient number, since it is larger than the sum of its proper divisors (1956788089).
58040143111 is a wasteful number, since it uses less digits than its factorization.
58040143111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2641449.
The product of its (nonzero) digits is 1920, while the sum is 28.
Adding to 58040143111 its reverse (11134104085), we get a palindrome (69174247196).
The spelling of 58040143111 in words is "fifty-eight billion, forty million, one hundred forty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •