Base | Representation |
---|---|
bin | 111010001001010011011101… |
… | …101000111011111110100000 |
3 | 1020112110011200121011010000002 |
4 | 322021103131220323332200 |
5 | 232004303443223100000 |
6 | 2303514534011115132 |
7 | 104602412304026450 |
oct | 7211233550737640 |
9 | 1215404617133002 |
10 | 255726071300000 |
11 | 745338aa536114 |
12 | 24821513a42aa8 |
13 | ac8cb3268bb82 |
14 | 47212ca64dd60 |
15 | 1e8704e2628d5 |
hex | e894dda3bfa0 |
255726071300000 has 288 divisors, whose sum is σ = 726304374794880. Its totient is φ = 86809392000000.
The previous prime is 255726071299997. The next prime is 255726071300033. The reversal of 255726071300000 is 3170627552.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 68891471 + ... + 72508529.
It is an arithmetic number, because the mean of its divisors is an integer number (2521890190260).
Almost surely, 2255726071300000 is an apocalyptic number.
255726071300000 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 255726071300000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (363152187397440).
255726071300000 is an abundant number, since it is smaller than the sum of its proper divisors (470578303494880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255726071300000 is an equidigital number, since it uses as much as digits as its factorization.
255726071300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3617202 (or 3617174 counting only the distinct ones).
The product of its (nonzero) digits is 88200, while the sum is 38.
The spelling of 255726071300000 in words is "two hundred fifty-five trillion, seven hundred twenty-six billion, seventy-one million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •