Base | Representation |
---|---|
bin | 111000000100101010… |
… | …0111000001000000000 |
3 | 102111210222002211200021 |
4 | 1300021110320020000 |
5 | 3433102340131000 |
6 | 131152415103224 |
7 | 11462003206162 |
oct | 1601124701000 |
9 | 374728084607 |
10 | 120415552000 |
11 | 47082492527 |
12 | 1b406b11b14 |
13 | b480312623 |
14 | 5b845d8932 |
15 | 31eb6dc11a |
hex | 1c09538200 |
120415552000 has 80 divisors (see below), whose sum is σ = 300263864472. Its totient is φ = 48166195200.
The previous prime is 120415551959. The next prime is 120415552007. The reversal of 120415552000 is 255514021.
It can be written as a sum of positive squares in 4 ways, for example, as 8902299904 + 111513252096 = 94352^2 + 333936^2 .
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (120415552007) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 876747 + ... + 1004746.
Almost surely, 2120415552000 is an apocalyptic number.
120415552000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120415552000 is an abundant number, since it is smaller than the sum of its proper divisors (179848312472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120415552000 is an frugal number, since it uses more digits than its factorization.
120415552000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1881526 (or 1881500 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 25.
The spelling of 120415552000 in words is "one hundred twenty billion, four hundred fifteen million, five hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •