Base | Representation |
---|---|
bin | 1110010100011… |
… | …00100100100010 |
3 | 22101000101200000 |
4 | 13022030210202 |
5 | 221222112232 |
6 | 15530240430 |
7 | 2655642651 |
oct | 712144442 |
9 | 271011600 |
10 | 120113442 |
11 | 6188a009 |
12 | 34286116 |
13 | 1bb66757 |
14 | 11d49198 |
15 | a82927c |
hex | 728c922 |
120113442 has 48 divisors (see below), whose sum is σ = 272668032. Its totient is φ = 39625200.
The previous prime is 120113419. The next prime is 120113467. The reversal of 120113442 is 244311021.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47863 + ... + 50309.
It is an arithmetic number, because the mean of its divisors is an integer number (5680584).
Almost surely, 2120113442 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 120113442, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136334016).
120113442 is an abundant number, since it is smaller than the sum of its proper divisors (152554590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120113442 is a wasteful number, since it uses less digits than its factorization.
120113442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2565 (or 2553 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
The square root of 120113442 is about 10959.6278221480. The cubic root of 120113442 is about 493.3977948192.
Adding to 120113442 its reverse (244311021), we get a palindrome (364424463).
The spelling of 120113442 in words is "one hundred twenty million, one hundred thirteen thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •