Base | Representation |
---|---|
bin | 110010000010100111… |
… | …1111100101000000000 |
3 | 101021101020011212101211 |
4 | 1210011033330220000 |
5 | 3230040313431320 |
6 | 121211212535504 |
7 | 10523005021243 |
oct | 1440517745000 |
9 | 337336155354 |
10 | 107462248960 |
11 | 41635702200 |
12 | 189b0a81594 |
13 | a197810781 |
14 | 52b614725a |
15 | 2bde41155a |
hex | 19053fca00 |
107462248960 has 540 divisors, whose sum is σ = 308853657882. Its totient is φ = 35826278400.
The previous prime is 107462248931. The next prime is 107462248981. The reversal of 107462248960 is 69842264701.
It can be written as a sum of positive squares in only one way, i.e., 96716024064 + 10746224896 = 310992^2 + 103664^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 53 ways as a sum of consecutive naturals, for example, 3466524145 + ... + 3466524175.
Almost surely, 2107462248960 is an apocalyptic number.
107462248960 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 107462248960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154426828941).
107462248960 is an abundant number, since it is smaller than the sum of its proper divisors (201391408922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107462248960 is an equidigital number, since it uses as much as digits as its factorization.
107462248960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145 (or 68 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 49.
The spelling of 107462248960 in words is "one hundred seven billion, four hundred sixty-two million, two hundred forty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •