Base | Representation |
---|---|
bin | 1000100000010101110… |
… | …1011110100110010111 |
3 | 111222011101111120121200 |
4 | 2020011131132212113 |
5 | 4343223322023110 |
6 | 151043221243543 |
7 | 13362000525312 |
oct | 2100535364627 |
9 | 458141446550 |
10 | 146120501655 |
11 | 56a73239677 |
12 | 2439b5635b3 |
13 | 10a188cc0cb |
14 | 7102447979 |
15 | 3c0320d6c0 |
hex | 220575e997 |
146120501655 has 48 divisors (see below), whose sum is σ = 256095126144. Its totient is φ = 77065951680.
The previous prime is 146120501627. The next prime is 146120501669. The reversal of 146120501655 is 556105021641.
146120501655 is a `hidden beast` number, since 14 + 61 + 20 + 501 + 65 + 5 = 666.
146120501655 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 146120501655 - 212 = 146120497559 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2722792 + ... + 2775938.
It is an arithmetic number, because the mean of its divisors is an integer number (5335315128).
Almost surely, 2146120501655 is an apocalyptic number.
146120501655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
146120501655 is a deficient number, since it is larger than the sum of its proper divisors (109974624489).
146120501655 is a wasteful number, since it uses less digits than its factorization.
146120501655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53836 (or 53833 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 146120501655 in words is "one hundred forty-six billion, one hundred twenty million, five hundred one thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •