Base | Representation |
---|---|
bin | 111010000000011000001000… |
… | …100001000001010011101011 |
3 | 1020110021112020110002111121220 |
4 | 322000120020201001103223 |
5 | 231414231111220243033 |
6 | 2302325040521233123 |
7 | 104510164206531534 |
oct | 7200301041012353 |
9 | 1213245213074556 |
10 | 255112610321643 |
11 | 74317717833318 |
12 | 247426490327a3 |
13 | ac47028cbb019 |
14 | 46dd73272568b |
15 | 1e760e7786bb3 |
hex | e806088414eb |
255112610321643 has 8 divisors (see below), whose sum is σ = 340398976762368. Its totient is φ = 169950658714344.
The previous prime is 255112610321579. The next prime is 255112610321659. The reversal of 255112610321643 is 346123016211552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 255112610321643 - 26 = 255112610321579 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 255112610321595 and 255112610321604.
It is not an unprimeable number, because it can be changed into a prime (255112660321643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31103703571 + ... + 31103711772.
It is an arithmetic number, because the mean of its divisors is an integer number (42549872095296).
Almost surely, 2255112610321643 is an apocalyptic number.
255112610321643 is a deficient number, since it is larger than the sum of its proper divisors (85286366440725).
255112610321643 is a wasteful number, since it uses less digits than its factorization.
255112610321643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62207416713.
The product of its (nonzero) digits is 259200, while the sum is 42.
The spelling of 255112610321643 in words is "two hundred fifty-five trillion, one hundred twelve billion, six hundred ten million, three hundred twenty-one thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •