Base | Representation |
---|---|
bin | 1110110110000110111… |
… | …0000000001111000000 |
3 | 220101022100111102011021 |
4 | 3231201232000033000 |
5 | 13134311341120000 |
6 | 313055342155224 |
7 | 24266122436152 |
oct | 3554156001700 |
9 | 811270442137 |
10 | 255042520000 |
11 | 99187943154 |
12 | 41519282b14 |
13 | 1b086987338 |
14 | c4b63c0ad2 |
15 | 697a86e11a |
hex | 3b61b803c0 |
255042520000 has 140 divisors (see below), whose sum is σ = 632932877896. Its totient is φ = 101934720000.
The previous prime is 255042519989. The next prime is 255042520027. The reversal of 255042520000 is 25240552.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 83318470 + ... + 83321530.
Almost surely, 2255042520000 is an apocalyptic number.
255042520000 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 255042520000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (316466438948).
255042520000 is an abundant number, since it is smaller than the sum of its proper divisors (377890357896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255042520000 is an equidigital number, since it uses as much as digits as its factorization.
255042520000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5176 (or 5151 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 25.
Adding to 255042520000 its reverse (25240552), we get a palindrome (255067760552).
The spelling of 255042520000 in words is "two hundred fifty-five billion, forty-two million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •