Base | Representation |
---|---|
bin | 111001111110110010010001… |
… | …000111110100101111000000 |
3 | 1020102220001220202110011201011 |
4 | 321332302101013310233000 |
5 | 231410433110124423230 |
6 | 2302202511254450304 |
7 | 104466242556162415 |
oct | 7176622107645700 |
9 | 1212801822404634 |
10 | 255003233045440 |
11 | 7428529a151880 |
12 | 24725402963994 |
13 | ac39917814b49 |
14 | 46d831812210c |
15 | 1e73345199e2a |
hex | e7ec911f4bc0 |
255003233045440 has 112 divisors (see below), whose sum is σ = 662496751732320. Its totient is φ = 92718943764480.
The previous prime is 255003233045377. The next prime is 255003233045467. The reversal of 255003233045440 is 44540332300552.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 255003233045393 and 255003233045402.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30679024 + ... + 38094736.
Almost surely, 2255003233045440 is an apocalyptic number.
255003233045440 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
255003233045440 is an abundant number, since it is smaller than the sum of its proper divisors (407493518686880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255003233045440 is a wasteful number, since it uses less digits than its factorization.
255003233045440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7425510 (or 7425500 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 40.
Adding to 255003233045440 its reverse (44540332300552), we get a palindrome (299543565345992).
The spelling of 255003233045440 in words is "two hundred fifty-five trillion, three billion, two hundred thirty-three million, forty-five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •