Base | Representation |
---|---|
bin | 101010001101001001100… |
… | …1010100100101100101111 |
3 | 202112112120000010220220012 |
4 | 1110122103022210230233 |
5 | 1230014240231401421 |
6 | 20200443201443435 |
7 | 1136041062611300 |
oct | 124322312445457 |
9 | 22475500126805 |
10 | 5800674872111 |
11 | 19370638186a9 |
12 | 79826234057b |
13 | 331002ac2842 |
14 | 160a7b5c47a7 |
15 | a0d4edc095b |
hex | 546932a4b2f |
5800674872111 has 12 divisors (see below), whose sum is σ = 6749760760992. Its totient is φ = 4970506137408.
The previous prime is 5800674872087. The next prime is 5800674872117. The reversal of 5800674872111 is 1112784760085.
It is a happy number.
It is not a de Polignac number, because 5800674872111 - 230 = 5799601130287 is a prime.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
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 5800674872111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5800674872117) 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, 17703815 + ... + 18028488.
It is an arithmetic number, because the mean of its divisors is an integer number (562480063416).
Almost surely, 25800674872111 is an apocalyptic number.
5800674872111 is a deficient number, since it is larger than the sum of its proper divisors (949085888881).
5800674872111 is a wasteful number, since it uses less digits than its factorization.
5800674872111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35735630 (or 35735623 counting only the distinct ones).
The product of its (nonzero) digits is 752640, while the sum is 50.
The spelling of 5800674872111 in words is "five trillion, eight hundred billion, six hundred seventy-four million, eight hundred seventy-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •