Base | Representation |
---|---|
bin | 10001011010011… |
… | …11000101100101 |
3 | 101011212102121102 |
4 | 20231033011211 |
5 | 244343413010 |
6 | 22254525445 |
7 | 3422424365 |
oct | 1055170545 |
9 | 334772542 |
10 | 146076005 |
11 | 75502079 |
12 | 40b06885 |
13 | 24356b0a |
14 | 155869a5 |
15 | cc56ba5 |
hex | 8b4f165 |
146076005 has 4 divisors (see below), whose sum is σ = 175291212. Its totient is φ = 116860800.
The previous prime is 146076001. The next prime is 146076011. The reversal of 146076005 is 500670641.
146076005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 500670641 = 97 ⋅5161553.
It can be written as a sum of positive squares in 2 ways, for example, as 71132356 + 74943649 = 8434^2 + 8657^2 .
It is not a de Polignac number, because 146076005 - 22 = 146076001 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 (146076001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14607596 + ... + 14607605.
It is an arithmetic number, because the mean of its divisors is an integer number (43822803).
Almost surely, 2146076005 is an apocalyptic number.
It is an amenable number.
146076005 is a deficient number, since it is larger than the sum of its proper divisors (29215207).
146076005 is an equidigital number, since it uses as much as digits as its factorization.
146076005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29215206.
The product of its (nonzero) digits is 5040, while the sum is 29.
The square root of 146076005 is about 12086.1906736573. The cubic root of 146076005 is about 526.6551002018.
The spelling of 146076005 in words is "one hundred forty-six million, seventy-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •