Base | Representation |
---|---|
bin | 1000100001110101100… |
… | …0101001000110001111 |
3 | 112000012100210001221222 |
4 | 2020131120221012033 |
5 | 4400034100341434 |
6 | 151151120313555 |
7 | 13404643330316 |
oct | 2103530510617 |
9 | 460170701858 |
10 | 146521887119 |
11 | 571598704a3 |
12 | 24491a728bb |
13 | 10a80b071ba |
14 | 713d88d27d |
15 | 3c2859772e |
hex | 221d62918f |
146521887119 has 4 divisors (see below), whose sum is σ = 146944140744. Its totient is φ = 146099633496.
The previous prime is 146521887107. The next prime is 146521887137. The reversal of 146521887119 is 911788125641.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911788125641 = 463 ⋅1969304807.
It is a cyclic number.
It is not a de Polignac number, because 146521887119 - 216 = 146521821583 is a prime.
It is a super-2 number, since 2×1465218871192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146521887179) 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, 211126292 + ... + 211126985.
It is an arithmetic number, because the mean of its divisors is an integer number (36736035186).
Almost surely, 2146521887119 is an apocalyptic number.
146521887119 is a deficient number, since it is larger than the sum of its proper divisors (422253625).
146521887119 is an equidigital number, since it uses as much as digits as its factorization.
146521887119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422253624.
The product of its digits is 967680, while the sum is 53.
The spelling of 146521887119 in words is "one hundred forty-six billion, five hundred twenty-one million, eight hundred eighty-seven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •