Base | Representation |
---|---|
bin | 10001011010011… |
… | …00111011010101 |
3 | 101011211222110201 |
4 | 20231030323111 |
5 | 244343122112 |
6 | 22254420501 |
7 | 3422356525 |
oct | 1055147325 |
9 | 334758421 |
10 | 146067157 |
11 | 754a6465 |
12 | 40b01731 |
13 | 24352a92 |
14 | 15583685 |
15 | cc54257 |
hex | 8b4ced5 |
146067157 has 8 divisors (see below), whose sum is σ = 150218712. Its totient is φ = 141926400.
The previous prime is 146067151. The next prime is 146067161. The reversal of 146067157 is 751760641.
It can be written as a sum of positive squares in 4 ways, for example, as 45887076 + 100180081 = 6774^2 + 10009^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146067157 - 23 = 146067149 is a prime.
It is a super-2 number, since 2×1460671572 = 42671228708125298, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146067151) 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, 30357 + ... + 34837.
It is an arithmetic number, because the mean of its divisors is an integer number (18777339).
Almost surely, 2146067157 is an apocalyptic number.
It is an amenable number.
146067157 is a deficient number, since it is larger than the sum of its proper divisors (4151555).
146067157 is an equidigital number, since it uses as much as digits as its factorization.
146067157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5399.
The product of its (nonzero) digits is 35280, while the sum is 37.
The square root of 146067157 is about 12085.8246305331. The cubic root of 146067157 is about 526.6444666086.
The spelling of 146067157 in words is "one hundred forty-six million, sixty-seven thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •