Base | Representation |
---|---|
bin | 10001011110110… |
… | …01100011000101 |
3 | 101012221020120110 |
4 | 20233121203011 |
5 | 300020040031 |
6 | 22315023233 |
7 | 3430306011 |
oct | 1057314305 |
9 | 335836513 |
10 | 146643141 |
11 | 7585a187 |
12 | 4113ab19 |
13 | 244c4cb8 |
14 | 15693541 |
15 | cd19c46 |
hex | 8bd98c5 |
146643141 has 8 divisors (see below), whose sum is σ = 195990304. Its totient is φ = 97529040.
The previous prime is 146643109. The next prime is 146643157. The reversal of 146643141 is 141346641.
146643141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 146643141 - 25 = 146643109 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 146643099 and 146643108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146643941) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56791 + ... + 59316.
It is an arithmetic number, because the mean of its divisors is an integer number (24498788).
Almost surely, 2146643141 is an apocalyptic number.
It is an amenable number.
146643141 is a deficient number, since it is larger than the sum of its proper divisors (49347163).
146643141 is a wasteful number, since it uses less digits than its factorization.
146643141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116531.
The product of its digits is 6912, while the sum is 30.
The square root of 146643141 is about 12109.6300934422. The cubic root of 146643141 is about 527.3357945956.
Adding to 146643141 its reverse (141346641), we get a palindrome (287989782).
The spelling of 146643141 in words is "one hundred forty-six million, six hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •