Base | Representation |
---|---|
bin | 10111001110011001001011… |
… | …000110000111111011010000 |
3 | 111101122212221222110102102022 |
4 | 113032121023012013323100 |
5 | 101342012231031130000 |
6 | 1001124215044511012 |
7 | 30341446543423040 |
oct | 2716311306077320 |
9 | 441585858412368 |
10 | 102144172130000 |
11 | 2a601111302120 |
12 | b5582846ab468 |
13 | 44cc20073a680 |
14 | 1b31b3904d720 |
15 | bc200e8e5585 |
hex | 5ce64b187ed0 |
102144172130000 has 800 divisors, whose sum is σ = 332287333416192. Its totient is φ = 29366323200000.
The previous prime is 102144172129931. The next prime is 102144172130017. The reversal of 102144172130000 is 31271441201.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 17547527090 + ... + 17547532910.
Almost surely, 2102144172130000 is an apocalyptic number.
102144172130000 is a gapful number since it is divisible by the number (10) 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 102144172130000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166143666708096).
102144172130000 is an abundant number, since it is smaller than the sum of its proper divisors (230143161286192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102144172130000 is a wasteful number, since it uses less digits than its factorization.
102144172130000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7633 (or 7612 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 26.
The spelling of 102144172130000 in words is "one hundred two trillion, one hundred forty-four billion, one hundred seventy-two million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •