Base | Representation |
---|---|
bin | 100101010111101010111… |
… | …010111110001100011110 |
3 | 100002111112220022021120110 |
4 | 211113222322332030132 |
5 | 314033314410201413 |
6 | 5243423445030450 |
7 | 353351226444615 |
oct | 45275272761436 |
9 | 10074486267513 |
10 | 2568036803358 |
11 | 900109910694 |
12 | 3558523b5426 |
13 | 15821b199c70 |
14 | 8c417a9087c |
15 | 46c01bcd8c3 |
hex | 255eaebe31e |
2568036803358 has 32 divisors (see below), whose sum is σ = 5559233160096. Its totient is φ = 786154174848.
The previous prime is 2568036803333. The next prime is 2568036803359. The reversal of 2568036803358 is 8533086308652.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2568036803298 and 2568036803307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2568036803359) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 83546941 + ... + 83577672.
It is an arithmetic number, because the mean of its divisors is an integer number (173726036253).
Almost surely, 22568036803358 is an apocalyptic number.
2568036803358 is an abundant number, since it is smaller than the sum of its proper divisors (2991196356738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2568036803358 is a wasteful number, since it uses less digits than its factorization.
2568036803358 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167124828.
The product of its (nonzero) digits is 24883200, while the sum is 57.
The spelling of 2568036803358 in words is "two trillion, five hundred sixty-eight billion, thirty-six million, eight hundred three thousand, three hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •