Base | Representation |
---|---|
bin | 110110010000101001… |
… | …101000100010000100 |
3 | 12120101100010011201100 |
4 | 312100221220202010 |
5 | 1423304410023001 |
6 | 42433120100100 |
7 | 4131525540000 |
oct | 662051504204 |
9 | 176340104640 |
10 | 58261407876 |
11 | 22788056071 |
12 | b35b764630 |
13 | 56564bab59 |
14 | 2b69a03700 |
15 | 17aecc9586 |
hex | d90a68884 |
58261407876 has 135 divisors (see below), whose sum is σ = 172016504933. Its totient is φ = 16625841120.
The previous prime is 58261407857. The next prime is 58261407877. The reversal of 58261407876 is 67870416285.
The square root of 58261407876 is 241374.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 15907767876 + 42353640000 = 126126^2 + 205800^2 .
It is not an unprimeable number, because it can be changed into a prime (58261407877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 70963546 + ... + 70964366.
Almost surely, 258261407876 is an apocalyptic number.
58261407876 is the 241374-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 58261407876
58261407876 is an abundant number, since it is smaller than the sum of its proper divisors (113755097057).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
58261407876 is an frugal number, since it uses more digits than its factorization.
58261407876 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1680 (or 833 counting only the distinct ones).
The product of its (nonzero) digits is 4515840, while the sum is 54.
The spelling of 58261407876 in words is "fifty-eight billion, two hundred sixty-one million, four hundred seven thousand, eight hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •