Base | Representation |
---|---|
bin | 1110011000010… |
… | …11001011101000 |
3 | 22101222202001100 |
4 | 13030023023220 |
5 | 221340211130 |
6 | 15545321400 |
7 | 2663232624 |
oct | 714131350 |
9 | 271882040 |
10 | 120632040 |
11 | 62103701 |
12 | 34496260 |
13 | 1bcb8809 |
14 | 12042184 |
15 | a8ccc60 |
hex | 730b2e8 |
120632040 has 48 divisors (see below), whose sum is σ = 392055300. Its totient is φ = 32168448.
The previous prime is 120632027. The next prime is 120632047. The reversal of 120632040 is 40236021.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 114190596 + 6441444 = 10686^2 + 2538^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (120632047) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 167185 + ... + 167904.
Almost surely, 2120632040 is an apocalyptic number.
120632040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120632040 is an abundant number, since it is smaller than the sum of its proper divisors (271423260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120632040 is a wasteful number, since it uses less digits than its factorization.
120632040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335106 (or 335099 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 120632040 is about 10983.2618105916. The cubic root of 120632040 is about 494.1068682122.
Adding to 120632040 its reverse (40236021), we get a palindrome (160868061).
The spelling of 120632040 in words is "one hundred twenty million, six hundred thirty-two thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •