Base | Representation |
---|---|
bin | 1110111000010110011… |
… | …1001010011001000101 |
3 | 220102212022121122120021 |
4 | 3232011213022121011 |
5 | 13142030021100443 |
6 | 313235213135141 |
7 | 24320054102440 |
oct | 3560547123105 |
9 | 812768548507 |
10 | 255644706373 |
11 | 99466854741 |
12 | 41666a8a4b1 |
13 | 1b15166a134 |
14 | c532376657 |
15 | 69b366e9ed |
hex | 3b859ca645 |
255644706373 has 16 divisors (see below), whose sum is σ = 293529450240. Its totient is φ = 218101689216.
The previous prime is 255644706353. The next prime is 255644706377. The reversal of 255644706373 is 373607446552.
255644706373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 255644706373 - 229 = 255107835461 is a prime.
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 255644706373.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255644706377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4533888 + ... + 4589926.
It is an arithmetic number, because the mean of its divisors is an integer number (18345590640).
Almost surely, 2255644706373 is an apocalyptic number.
It is an amenable number.
255644706373 is a deficient number, since it is larger than the sum of its proper divisors (37884743867).
255644706373 is a wasteful number, since it uses less digits than its factorization.
255644706373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59076.
The product of its (nonzero) digits is 12700800, while the sum is 52.
The spelling of 255644706373 in words is "two hundred fifty-five billion, six hundred forty-four million, seven hundred six thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •