Base | Representation |
---|---|
bin | 111001111111001110100011… |
… | …111110001100111111110000 |
3 | 1020102222222100001200200221010 |
4 | 321333032203332030333300 |
5 | 231411432320144432202 |
6 | 2302224454101230520 |
7 | 104501366463435414 |
oct | 7177164376147760 |
9 | 1212888301620833 |
10 | 255033614061552 |
11 | 7429716a474957 |
12 | 2472b281402440 |
13 | ac3c749b02761 |
14 | 46d999adccd44 |
15 | 1e7402248776c |
hex | e7f3a3f8cff0 |
255033614061552 has 40 divisors (see below), whose sum is σ = 658837408215040. Its totient is φ = 85011130895040.
The previous prime is 255033614061497. The next prime is 255033614061559. The reversal of 255033614061552 is 255160416330552.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255033614061559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106296699 + ... + 108669477.
It is an arithmetic number, because the mean of its divisors is an integer number (16470935205376).
Almost surely, 2255033614061552 is an apocalyptic number.
It is an amenable number.
255033614061552 is an abundant number, since it is smaller than the sum of its proper divisors (403803794153488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255033614061552 is a wasteful number, since it uses less digits than its factorization.
255033614061552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4612021 (or 4612015 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 48.
The spelling of 255033614061552 in words is "two hundred fifty-five trillion, thirty-three billion, six hundred fourteen million, sixty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •