Base | Representation |
---|---|
bin | 10111010001111100101110… |
… | …100010110000000000000000 |
3 | 111102112020122001011202222110 |
4 | 113101330232202300000000 |
5 | 101410013130043341114 |
6 | 1001432344100335320 |
7 | 30365216430132144 |
oct | 2721745642600000 |
9 | 442466561152873 |
10 | 102388506230784 |
11 | 2a6957a3560434 |
12 | b5976b36a4540 |
13 | 451926ba0ac77 |
14 | 1b3d8b7181224 |
15 | bc85600be759 |
hex | 5d1f2e8b0000 |
102388506230784 has 544 divisors, whose sum is σ = 286465422182400. Its totient is φ = 32503737876480.
The previous prime is 102388506230783. The next prime is 102388506230807. The reversal of 102388506230784 is 487032605883201.
It is not an unprimeable number, because it can be changed into a prime (102388506230783) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 50215058437 + ... + 50215060475.
It is an arithmetic number, because the mean of its divisors is an integer number (526590849600).
Almost surely, 2102388506230784 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102388506230784, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143232711091200).
102388506230784 is an abundant number, since it is smaller than the sum of its proper divisors (184076915951616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102388506230784 is an frugal number, since it uses more digits than its factorization.
102388506230784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2267 (or 2237 counting only the distinct ones).
The product of its (nonzero) digits is 15482880, while the sum is 57.
The spelling of 102388506230784 in words is "one hundred two trillion, three hundred eighty-eight billion, five hundred six million, two hundred thirty thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •