Base | Representation |
---|---|
bin | 11001000010110010100010… |
… | …100110100010100111000010 |
3 | 112102222112222221102210020222 |
4 | 121002302202212202213002 |
5 | 103414040044023211400 |
6 | 1030130534033503042 |
7 | 32125362660125330 |
oct | 3102624246424702 |
9 | 472875887383228 |
10 | 110142869350850 |
11 | 3210536836a076 |
12 | 1042a514111a82 |
13 | 495c57446289b |
14 | 1d2ad2c686b50 |
15 | cb01072bc185 |
hex | 642ca29a29c2 |
110142869350850 has 24 divisors (see below), whose sum is σ = 234132270849408. Its totient is φ = 37763269491600.
The previous prime is 110142869350837. The next prime is 110142869350867. The reversal of 110142869350850 is 58053968241011.
It is a junction number, because it is equal to n+sod(n) for n = 110142869350792 and 110142869350801.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 157346955866 + ... + 157346956565.
It is an arithmetic number, because the mean of its divisors is an integer number (9755511285392).
Almost surely, 2110142869350850 is an apocalyptic number.
110142869350850 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110142869350850 is an abundant number, since it is smaller than the sum of its proper divisors (123989401498558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110142869350850 is a wasteful number, since it uses less digits than its factorization.
110142869350850 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314693912450 (or 314693912445 counting only the distinct ones).
The product of its (nonzero) digits is 2073600, while the sum is 53.
The spelling of 110142869350850 in words is "one hundred ten trillion, one hundred forty-two billion, eight hundred sixty-nine million, three hundred fifty thousand, eight hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •