Base | Representation |
---|---|
bin | 1110011010100… |
… | …01101001110000 |
3 | 22102112102000000 |
4 | 13031101221300 |
5 | 221423430223 |
6 | 15555430000 |
7 | 2665544310 |
oct | 715215160 |
9 | 272472000 |
10 | 120920688 |
11 | 62290559 |
12 | 345b5300 |
13 | 1c08a005 |
14 | 120b9440 |
15 | a938543 |
hex | 7351a70 |
120920688 has 140 divisors (see below), whose sum is σ = 401716848. Its totient is φ = 34525440.
The previous prime is 120920671. The next prime is 120920713. The reversal of 120920688 is 886029021.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 80908 + ... + 82388.
Almost surely, 2120920688 is an apocalyptic number.
120920688 is a gapful number since it is divisible by the number (18) 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 120920688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200858424).
120920688 is an abundant number, since it is smaller than the sum of its proper divisors (280796160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120920688 is an equidigital number, since it uses as much as digits as its factorization.
120920688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1514 (or 1493 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 36.
The square root of 120920688 is about 10996.3943181390. The cubic root of 120920688 is about 494.5006534629.
The spelling of 120920688 in words is "one hundred twenty million, nine hundred twenty thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •