Base | Representation |
---|---|
bin | 1110110111001000011… |
… | …0011000011111000000 |
3 | 220102000111122000212220 |
4 | 3231302012120133000 |
5 | 13140342220034430 |
6 | 313142520451040 |
7 | 24306000430635 |
oct | 3556206303700 |
9 | 812014560786 |
10 | 255317346240 |
11 | 99308a93180 |
12 | 41595319a80 |
13 | 1b0cb8acb08 |
14 | c500ac018c |
15 | 6994a59110 |
hex | 3b721987c0 |
255317346240 has 224 divisors, whose sum is σ = 884838691584. Its totient is φ = 61859266560.
The previous prime is 255317346233. The next prime is 255317346241. The reversal of 255317346240 is 42643713552.
It is a junction number, because it is equal to n+sod(n) for n = 255317346192 and 255317346201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255317346241) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21293527 + ... + 21305513.
Almost surely, 2255317346240 is an apocalyptic number.
255317346240 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255317346240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (442419345792).
255317346240 is an abundant number, since it is smaller than the sum of its proper divisors (629521345344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255317346240 is a wasteful number, since it uses less digits than its factorization.
255317346240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14035 (or 14025 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 42.
The spelling of 255317346240 in words is "two hundred fifty-five billion, three hundred seventeen million, three hundred forty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •