Base | Representation |
---|---|
bin | 11010011000000101001010… |
… | …00110011111111100000111 |
3 | 21121100221022200112100201220 |
4 | 31030002211012133330013 |
5 | 30100301103111401021 |
6 | 323205431010251423 |
7 | 15134335556661210 |
oct | 1514024506377407 |
9 | 247327280470656 |
10 | 58002008309511 |
11 | 17532571643a52 |
12 | 6609217286b73 |
13 | 2649748410756 |
14 | 10474528a6407 |
15 | 6a8b73079cc6 |
hex | 34c0a519ff07 |
58002008309511 has 32 divisors (see below), whose sum is σ = 90835503221760. Its totient is φ = 32225933949696.
The previous prime is 58002008309467. The next prime is 58002008309521. The reversal of 58002008309511 is 11590380020085.
58002008309511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 58002008309511 - 230 = 58000934567687 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58002008309521) 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 31 ways as a sum of consecutive naturals, for example, 24669966 + ... + 26918603.
It is an arithmetic number, because the mean of its divisors is an integer number (2838609475680).
Almost surely, 258002008309511 is an apocalyptic number.
58002008309511 is a deficient number, since it is larger than the sum of its proper divisors (32833494912249).
58002008309511 is a wasteful number, since it uses less digits than its factorization.
58002008309511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51590063.
The product of its (nonzero) digits is 86400, while the sum is 42.
Adding to 58002008309511 its reverse (11590380020085), we get a palindrome (69592388329596).
The spelling of 58002008309511 in words is "fifty-eight trillion, two billion, eight million, three hundred nine thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •