Base | Representation |
---|---|
bin | 1110111001000001100… |
… | …1110100100010001111 |
3 | 220110022221022001012002 |
4 | 3232100121310202033 |
5 | 13142412343231401 |
6 | 313305201502515 |
7 | 24324413031662 |
oct | 3562031644217 |
9 | 813287261162 |
10 | 255825758351 |
11 | 99549a75779 |
12 | 416b7641a3b |
13 | 1b18001ba97 |
14 | c54c4256d9 |
15 | 69c44d4a6b |
hex | 3b9067488f |
255825758351 has 8 divisors (see below), whose sum is σ = 260297183664. Its totient is φ = 251363286720.
The previous prime is 255825758299. The next prime is 255825758359. The reversal of 255825758351 is 153857528552.
It is a happy number.
255825758351 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-255825758351 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255825758359) 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 7 ways as a sum of consecutive naturals, for example, 2180765 + ... + 2295078.
It is an arithmetic number, because the mean of its divisors is an integer number (32537147958).
Almost surely, 2255825758351 is an apocalyptic number.
255825758351 is a deficient number, since it is larger than the sum of its proper divisors (4471425313).
255825758351 is an equidigital number, since it uses as much as digits as its factorization.
255825758351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4476841.
The product of its digits is 16800000, while the sum is 56.
The spelling of 255825758351 in words is "two hundred fifty-five billion, eight hundred twenty-five million, seven hundred fifty-eight thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •