Base | Representation |
---|---|
bin | 111010000011010011000011… |
… | …011000110011100000111000 |
3 | 1020110222201021211110220110210 |
4 | 322003103003120303200320 |
5 | 231431023131341044000 |
6 | 2303001152305511120 |
7 | 104530530633631641 |
oct | 7203230330634070 |
9 | 1213881254426423 |
10 | 255313314003000 |
11 | 7439484a828760 |
12 | 247755203424a0 |
13 | ac5cc330380a6 |
14 | 470933205c6c8 |
15 | 1e7b4428a9350 |
hex | e834c3633838 |
255313314003000 has 128 divisors (see below), whose sum is σ = 868993679773440. Its totient is φ = 61894136720000.
The previous prime is 255313314002969. The next prime is 255313314003049. The reversal of 255313314003000 is 300413313552.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3868350546 + ... + 3868416545.
It is an arithmetic number, because the mean of its divisors is an integer number (6789013123230).
Almost surely, 2255313314003000 is an apocalyptic number.
255313314003000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
255313314003000 is an abundant number, since it is smaller than the sum of its proper divisors (613680365770440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255313314003000 is a wasteful number, since it uses less digits than its factorization.
255313314003000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7736767126 (or 7736767112 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 255313314003000 its reverse (300413313552), we get a palindrome (255613727316552).
The spelling of 255313314003000 in words is "two hundred fifty-five trillion, three hundred thirteen billion, three hundred fourteen million, three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •