Base | Representation |
---|---|
bin | 110110000100010001… |
… | …001111001010111101 |
3 | 12112211212020210210122 |
4 | 312010101033022331 |
5 | 1422343220422244 |
6 | 42400335544325 |
7 | 4123424121500 |
oct | 660421171275 |
9 | 175755223718 |
10 | 58053685949 |
11 | 22690879556 |
12 | b30208b0a5 |
13 | 562245bb7c |
14 | 2b4a1b1137 |
15 | 179b9471ee |
hex | d8444f2bd |
58053685949 has 12 divisors (see below), whose sum is σ = 67536598428. Its totient is φ = 49756795200.
The previous prime is 58053685939. The next prime is 58053685967. The reversal of 58053685949 is 94958635085.
58053685949 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 7717622500 + 50336063449 = 87850^2 + 224357^2 .
It is not a de Polignac number, because 58053685949 - 24 = 58053685933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 58053685891 and 58053685900.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (58053685939) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 855239 + ... + 920619.
It is an arithmetic number, because the mean of its divisors is an integer number (5628049869).
Almost surely, 258053685949 is an apocalyptic number.
It is an amenable number.
58053685949 is a deficient number, since it is larger than the sum of its proper divisors (9482912479).
58053685949 is a wasteful number, since it uses less digits than its factorization.
58053685949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83516 (or 83509 counting only the distinct ones).
The product of its (nonzero) digits is 46656000, while the sum is 62.
The spelling of 58053685949 in words is "fifty-eight billion, fifty-three million, six hundred eighty-five thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •