Base | Representation |
---|---|
bin | 1000100000001001111… |
… | …0111100101001101001 |
3 | 111222000220112001000111 |
4 | 2020002132330221221 |
5 | 4343123030231431 |
6 | 151034234534321 |
7 | 13360523143042 |
oct | 2100236745151 |
9 | 458026461014 |
10 | 146070555241 |
11 | 56a48025146 |
12 | 243868973a1 |
13 | 10a0b462210 |
14 | 70d99658c9 |
15 | 3bedb447b1 |
hex | 22027bca69 |
146070555241 has 4 divisors (see below), whose sum is σ = 157306751812. Its totient is φ = 134834358672.
The previous prime is 146070555227. The next prime is 146070555283. The reversal of 146070555241 is 142555070641.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12410851216 + 133659704025 = 111404^2 + 365595^2 .
It is not a de Polignac number, because 146070555241 - 25 = 146070555209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146070555194 and 146070555203.
It is not an unprimeable number, because it can be changed into a prime (146070555041) 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 3 ways as a sum of consecutive naturals, for example, 5618098266 + ... + 5618098291.
It is an arithmetic number, because the mean of its divisors is an integer number (39326687953).
Almost surely, 2146070555241 is an apocalyptic number.
It is an amenable number.
146070555241 is a deficient number, since it is larger than the sum of its proper divisors (11236196571).
146070555241 is a wasteful number, since it uses less digits than its factorization.
146070555241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11236196570.
The product of its (nonzero) digits is 168000, while the sum is 40.
The spelling of 146070555241 in words is "one hundred forty-six billion, seventy million, five hundred fifty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •