Base | Representation |
---|---|
bin | 111000001010110001… |
… | …0001010000101110111 |
3 | 102112100020111011111210 |
4 | 1300111202022011313 |
5 | 3434012303010210 |
6 | 131225012532503 |
7 | 11500041100206 |
oct | 1602542120567 |
9 | 375306434453 |
10 | 120620360055 |
11 | 47178059888 |
12 | 1b463621133 |
13 | b4b3891220 |
14 | 5ba38ad23d |
15 | 320e695e20 |
hex | 1c1588a177 |
120620360055 has 32 divisors (see below), whose sum is σ = 207873779904. Its totient is φ = 59372153856.
The previous prime is 120620360051. The next prime is 120620360059. The reversal of 120620360055 is 550063026021.
It is an interprime number because it is at equal distance from previous prime (120620360051) and next prime (120620360059).
It is not a de Polignac number, because 120620360055 - 22 = 120620360051 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120620360051) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1158507 + ... + 1258323.
It is an arithmetic number, because the mean of its divisors is an integer number (6496055622).
Almost surely, 2120620360055 is an apocalyptic number.
120620360055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
120620360055 is a deficient number, since it is larger than the sum of its proper divisors (87253419849).
120620360055 is a wasteful number, since it uses less digits than its factorization.
120620360055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106035.
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 120620360055 its reverse (550063026021), we get a palindrome (670683386076).
The spelling of 120620360055 in words is "one hundred twenty billion, six hundred twenty million, three hundred sixty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •