Base | Representation |
---|---|
bin | 1110110110000111101… |
… | …1010100101010000001 |
3 | 220101022121001210121212 |
4 | 3231201323110222001 |
5 | 13134313234332041 |
6 | 313055545055505 |
7 | 24266164220420 |
oct | 3554173245201 |
9 | 811277053555 |
10 | 255046011521 |
11 | 99189908404 |
12 | 4151a487595 |
13 | 1b08760a622 |
14 | c4b6a4d2b7 |
15 | 697ad0d8eb |
hex | 3b61ed4a81 |
255046011521 has 4 divisors (see below), whose sum is σ = 291481156032. Its totient is φ = 218610867012.
The previous prime is 255046011481. The next prime is 255046011523. The reversal of 255046011521 is 125110640552.
255046011521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-255046011521 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (255046011523) 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 3 ways as a sum of consecutive naturals, for example, 18217572245 + ... + 18217572258.
It is an arithmetic number, because the mean of its divisors is an integer number (72870289008).
Almost surely, 2255046011521 is an apocalyptic number.
It is an amenable number.
255046011521 is a deficient number, since it is larger than the sum of its proper divisors (36435144511).
255046011521 is an equidigital number, since it uses as much as digits as its factorization.
255046011521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36435144510.
The product of its (nonzero) digits is 12000, while the sum is 32.
The spelling of 255046011521 in words is "two hundred fifty-five billion, forty-six million, eleven thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •