Base | Representation |
---|---|
bin | 10001011010111… |
… | …11001100111101 |
3 | 101011222210011011 |
4 | 20231133030331 |
5 | 244403021023 |
6 | 22300155221 |
7 | 3423121003 |
oct | 1055371475 |
9 | 334883134 |
10 | 146142013 |
11 | 75547726 |
12 | 40b38b11 |
13 | 2437ab84 |
14 | 155a2a73 |
15 | cc6b50d |
hex | 8b5f33d |
146142013 has 4 divisors (see below), whose sum is σ = 154738620. Its totient is φ = 137545408.
The previous prime is 146141929. The next prime is 146142019. The reversal of 146142013 is 310241641.
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 100741369 + 45400644 = 10037^2 + 6738^2 .
It is a cyclic number.
It is not a de Polignac number, because 146142013 - 213 = 146133821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146142019) 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, 4298278 + ... + 4298311.
It is an arithmetic number, because the mean of its divisors is an integer number (38684655).
Almost surely, 2146142013 is an apocalyptic number.
It is an amenable number.
146142013 is a deficient number, since it is larger than the sum of its proper divisors (8596607).
146142013 is an equidigital number, since it uses as much as digits as its factorization.
146142013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8596606.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 146142013 is about 12088.9210850266. The cubic root of 146142013 is about 526.7344155667.
Adding to 146142013 its reverse (310241641), we get a palindrome (456383654).
The spelling of 146142013 in words is "one hundred forty-six million, one hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •