Base | Representation |
---|---|
bin | 111010000001110111111001… |
… | …010000001011000011110000 |
3 | 1020110122100122100222020101120 |
4 | 322001313321100023003300 |
5 | 231422422201431241000 |
6 | 2302444203534102240 |
7 | 104520464234024124 |
oct | 7201677120130360 |
9 | 1213570570866346 |
10 | 255215433462000 |
11 | 74357291811570 |
12 | 2475a56434a980 |
13 | ac5393466a5cb |
14 | 47046c86b1584 |
15 | 1e78b1477c6a0 |
hex | e81df940b0f0 |
255215433462000 has 320 divisors, whose sum is σ = 936642663889920. Its totient is φ = 59180390016000.
The previous prime is 255215433461777. The next prime is 255215433462001. The reversal of 255215433462000 is 264334512552.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255215433462001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 82545055 + ... + 85581054.
It is an arithmetic number, because the mean of its divisors is an integer number (2927008324656).
Almost surely, 2255215433462000 is an apocalyptic number.
255215433462000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
255215433462000 is an abundant number, since it is smaller than the sum of its proper divisors (681427230427920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255215433462000 is a wasteful number, since it uses less digits than its factorization.
255215433462000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168126169 (or 168126153 counting only the distinct ones).
The product of its (nonzero) digits is 864000, while the sum is 42.
Adding to 255215433462000 its reverse (264334512552), we get a palindrome (255479767974552).
The spelling of 255215433462000 in words is "two hundred fifty-five trillion, two hundred fifteen billion, four hundred thirty-three million, four hundred sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •