Base | Representation |
---|---|
bin | 111010000011010100111010… |
… | …000100011001001101100000 |
3 | 1020110222220102121011012102220 |
4 | 322003110322010121031200 |
5 | 231431041221104003323 |
6 | 2303002122034511040 |
7 | 104530631162214153 |
oct | 7203247204311540 |
9 | 1213886377135386 |
10 | 255315305141088 |
11 | 74395681772225 |
12 | 24775997135480 |
13 | ac6018c6cb8ca |
14 | 470948068bc9a |
15 | 1e7b50c5bb0e3 |
hex | e8353a119360 |
255315305141088 has 48 divisors (see below), whose sum is σ = 670204467137520. Its totient is φ = 85104874267136.
The previous prime is 255315305141053. The next prime is 255315305141089. The reversal of 255315305141088 is 880141503513552.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 255315305141088.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255315305141089) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34686106 + ... + 41397542.
It is an arithmetic number, because the mean of its divisors is an integer number (13962593065365).
Almost surely, 2255315305141088 is an apocalyptic number.
It is an amenable number.
255315305141088 is an abundant number, since it is smaller than the sum of its proper divisors (414889161996432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255315305141088 is a wasteful number, since it uses less digits than its factorization.
255315305141088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7107719 (or 7107711 counting only the distinct ones).
The product of its (nonzero) digits is 2880000, while the sum is 51.
The spelling of 255315305141088 in words is "two hundred fifty-five trillion, three hundred fifteen billion, three hundred five million, one hundred forty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •