Base | Representation |
---|---|
bin | 111001111111001101010111… |
… | …001010100000001010001110 |
3 | 1020102222212000020220221200020 |
4 | 321333031113022200022032 |
5 | 231411422200303041032 |
6 | 2302224122145443010 |
7 | 104501322525355605 |
oct | 7177152712401216 |
9 | 1212885006827606 |
10 | 255032325440142 |
11 | 74296669039588 |
12 | 2472ab81940466 |
13 | ac3c5a2b4c993 |
14 | 46d98b7bd0a3c |
15 | 1e73e99293b2c |
hex | e7f3572a028e |
255032325440142 has 8 divisors (see below), whose sum is σ = 510064650880296. Its totient is φ = 85010775146712.
The previous prime is 255032325440117. The next prime is 255032325440159. The reversal of 255032325440142 is 241044523230552.
It is a sphenic number, since it is the product of 3 distinct primes.
255032325440142 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 255032325440094 and 255032325440103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21252693786673 + ... + 21252693786684.
It is an arithmetic number, because the mean of its divisors is an integer number (63758081360037).
Almost surely, 2255032325440142 is an apocalyptic number.
255032325440142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255032325440142 is a wasteful number, since it uses less digits than its factorization.
255032325440142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42505387573362.
The product of its (nonzero) digits is 1152000, while the sum is 42.
Adding to 255032325440142 its reverse (241044523230552), we get a palindrome (496076848670694).
The spelling of 255032325440142 in words is "two hundred fifty-five trillion, thirty-two billion, three hundred twenty-five million, four hundred forty thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •