Base | Representation |
---|---|
bin | 1001010110000010001011… |
… | …1001000001000000000000 |
3 | 1100101012100222110002211110 |
4 | 2111200202321001000000 |
5 | 2321312423132044210 |
6 | 33503513353443320 |
7 | 2110165641540000 |
oct | 225404271010000 |
9 | 40335328402743 |
10 | 10274147143680 |
11 | 3301272241762 |
12 | 119b247110540 |
13 | 596b03b524c4 |
14 | 2773b2920000 |
15 | 12c3c2b16420 |
hex | 95822e41000 |
10274147143680 has 1040 divisors, whose sum is σ = 38641136073984. Its totient is φ = 2330606960640.
The previous prime is 10274147143657. The next prime is 10274147143693. The reversal of 10274147143680 is 8634174147201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 37911981945 + ... + 37911982215.
Almost surely, 210274147143680 is an apocalyptic number.
10274147143680 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 10274147143680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19320568036992).
10274147143680 is an abundant number, since it is smaller than the sum of its proper divisors (28366988930304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10274147143680 is an frugal number, since it uses more digits than its factorization.
10274147143680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 588 (or 545 counting only the distinct ones).
The product of its (nonzero) digits is 903168, while the sum is 48.
The spelling of 10274147143680 in words is "ten trillion, two hundred seventy-four billion, one hundred forty-seven million, one hundred forty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •