Base | Representation |
---|---|
bin | 111010000011101110110010… |
… | …110001100011111010011100 |
3 | 1020111002120011200011221000110 |
4 | 322003232302301203322130 |
5 | 231432020132103113400 |
6 | 2303023000100130020 |
7 | 104532634025104215 |
oct | 7203566261437234 |
9 | 1214076150157013 |
10 | 255343100051100 |
11 | 743a644521a536 |
12 | 2477b253696910 |
13 | ac6299bc9c619 |
14 | 470a959cd240c |
15 | 1e7c0d781ee50 |
hex | e83bb2c63e9c |
255343100051100 has 72 divisors (see below), whose sum is σ = 743498388956848. Its totient is φ = 67657789555200.
The previous prime is 255343100051041. The next prime is 255343100051161. The reversal of 255343100051100 is 1150001343552.
It is a super-2 number, since 2×2553431000511002 (a number of 30 digits) contains 22 as substring.
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 23 ways as a sum of consecutive naturals, for example, 2710601521 + ... + 2710695720.
Almost surely, 2255343100051100 is an apocalyptic number.
255343100051100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
255343100051100 is an abundant number, since it is smaller than the sum of its proper divisors (488155288905748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255343100051100 is a wasteful number, since it uses less digits than its factorization.
255343100051100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5421297415 (or 5421297408 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 255343100051100 its reverse (1150001343552), we get a palindrome (256493101394652).
The spelling of 255343100051100 in words is "two hundred fifty-five trillion, three hundred forty-three billion, one hundred million, fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •