Base | Representation |
---|---|
bin | 101111110110010111… |
… | …1000000100010001110 |
3 | 100211020020112022221000 |
4 | 1133230233000202032 |
5 | 3140421013244432 |
6 | 115112213321130 |
7 | 10265250351453 |
oct | 1375457004216 |
9 | 324206468830 |
10 | 102755993742 |
11 | 3a640096a86 |
12 | 17ab89361a6 |
13 | 98c779c77c |
14 | 4d8b0ab82a |
15 | 2a1618057c |
hex | 17ecbc088e |
102755993742 has 16 divisors (see below), whose sum is σ = 228346652880. Its totient is φ = 34251997896.
The previous prime is 102755993737. The next prime is 102755993759. The reversal of 102755993742 is 247399557201.
102755993742 is a `hidden beast` number, since 1 + 0 + 2 + 7 + 5 + 599 + 3 + 7 + 42 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54), and also a Moran number because the ratio is a prime number: 1902888773 = 102755993742 / (1 + 0 + 2 + 7 + 5 + 5 + 9 + 9 + 3 + 7 + 4 + 2).
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 951444333 + ... + 951444440.
It is an arithmetic number, because the mean of its divisors is an integer number (14271665805).
Almost surely, 2102755993742 is an apocalyptic number.
102755993742 is an abundant number, since it is smaller than the sum of its proper divisors (125590659138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102755993742 is a wasteful number, since it uses less digits than its factorization.
102755993742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1902888784 (or 1902888778 counting only the distinct ones).
The product of its (nonzero) digits is 4762800, while the sum is 54.
The spelling of 102755993742 in words is "one hundred two billion, seven hundred fifty-five million, nine hundred ninety-three thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.291 sec. • engine limits •