Base | Representation |
---|---|
bin | 110110011001100100… |
… | …010100001001110111 |
3 | 12120202202121200101001 |
4 | 312121210110021313 |
5 | 1424111204234011 |
6 | 42500022344131 |
7 | 4135323244543 |
oct | 663144241167 |
9 | 176682550331 |
10 | 58411008631 |
11 | 22854545358 |
12 | b3a188b047 |
13 | 567b4aa101 |
14 | 2b81826a23 |
15 | 17bceca7c1 |
hex | d99914277 |
58411008631 has 4 divisors (see below), whose sum is σ = 58411495912. Its totient is φ = 58410521352.
The previous prime is 58411008589. The next prime is 58411008641. The reversal of 58411008631 is 13680011485.
58411008631 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 58411008631 - 29 = 58411008119 is a prime.
It is a super-3 number, since 3×584110086313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58411008641) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75601 + ... + 350053.
It is an arithmetic number, because the mean of its divisors is an integer number (14602873978).
Almost surely, 258411008631 is an apocalyptic number.
58411008631 is a deficient number, since it is larger than the sum of its proper divisors (487281).
58411008631 is a wasteful number, since it uses less digits than its factorization.
58411008631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487280.
The product of its (nonzero) digits is 23040, while the sum is 37.
The spelling of 58411008631 in words is "fifty-eight billion, four hundred eleven million, eight thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •