Base | Representation |
---|---|
bin | 1110010111011… |
… | …11100110110010 |
3 | 22101210000010000 |
4 | 13023233212302 |
5 | 221323102330 |
6 | 15543050430 |
7 | 2662252416 |
oct | 713574662 |
9 | 271700100 |
10 | 120519090 |
11 | 6203685a |
12 | 34440a16 |
13 | 1bc79293 |
14 | 12012d46 |
15 | a8a9560 |
hex | 72ef9b2 |
120519090 has 160 divisors (see below), whose sum is σ = 351267840. Its totient is φ = 29548800.
The previous prime is 120519079. The next prime is 120519143. The reversal of 120519090 is 90915021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 630895 + ... + 631085.
It is an arithmetic number, because the mean of its divisors is an integer number (2195424).
Almost surely, 2120519090 is an apocalyptic number.
120519090 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 120519090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175633920).
120519090 is an abundant number, since it is smaller than the sum of its proper divisors (230748750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120519090 is a wasteful number, since it uses less digits than its factorization.
120519090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 27.
The square root of 120519090 is about 10978.1186912877. The cubic root of 120519090 is about 493.9526062702.
The spelling of 120519090 in words is "one hundred twenty million, five hundred nineteen thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •